Jan 15

Author: siddydutta

2025-01-January-LeetCoding-Challenge/Minimize XOR.py

@@ -0,0 +1,26 @@
+class Solution:
+    def minimizeXor(self, num1: int, num2: int) -> int:
+        n1, n2 = num1.bit_count(), num2.bit_count()
+        res = num1
+        for i in range(32):
+            if n1 > n2 and (1 << i) & num1 > 0:
+                res ^= 1 << i
+                n1 -= 1
+            if n1 < n2 and (1 << i) & num1 == 0:
+                res ^= 1 << i
+                n1 += 1
+        return res
+
+
+def main():
+    num1 = 3
+    num2 = 5
+    assert Solution().minimizeXor(num1, num2) == 3
+
+    num1 = 1
+    num2 = 12
+    assert Solution().minimizeXor(num1, num2) == 3
+
+
+if __name__ == '__main__':
+    main()

2025-01-January-LeetCoding-Challenge/README.md

@@ -17,7 +17,7 @@
 | January 12 | [2116. Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/) | Medium | Unsolved |
 | January 13 | [3223. Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations/) | Medium | Solved |
 | January 14 | [2657. Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | Medium | Solved |
-| January 15 | []() |  |  |
+| January 15 | [2429. Minimize XOR](https://leetcode.com/problems/minimize-xor/) | Medium | Unsolved |
 | January 16 | []() |  |  |
 | January 17 | []() |  |  |
 | January 18 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 10 | 9 | 1 |
+| Medium | 11 | 9 | 2 |
 | Hard   | 0 | 0 | 0 |