Feb 20

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Find Unique Binary String.py

@@ -0,0 +1,23 @@
+class Solution:
+    def findDifferentBinaryString(self, nums: list[str]) -> str:
+        n = len(nums[0])
+        nums = set(nums)
+        for i in range(2**n):
+            bin_str = (bin(i)[2:]).zfill(n)
+            if bin_str not in nums:
+                return bin_str
+
+
+def main():
+    nums = ['01', '10']
+    assert Solution().findDifferentBinaryString(nums) == '00'
+
+    nums = ['00', '01']
+    assert Solution().findDifferentBinaryString(nums) == '10'
+
+    nums = ['111', '011', '001']
+    assert Solution().findDifferentBinaryString(nums) == '000'
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -23,7 +23,7 @@
 | February 17 | [1079. Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/) | Medium | Solved |
 | February 18 | [2375. Construct Smallest Number From DI String](https://leetcode.com/problems/construct-smallest-number-from-di-string/) | Medium | Unsolved |
 | February 19 | [1415. The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/) | Medium | Unsolved |
-| February 20 | []() |  |  |
+| February 20 | [1980. Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/) | Medium | Solved |
 | February 21 | []() |  |  |
 | February 22 | []() |  |  |
 | February 23 | []() |  |  |
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 12 | 9 | 3 |
+| Medium | 13 | 10 | 3 |
 | Hard   | 0 | 0 | 0 |