Jan 16

Author: siddydutta

2025-01-January-LeetCoding-Challenge/Bitwise XOR of All Pairings.py

@@ -0,0 +1,27 @@
+from functools import reduce
+from operator import xor
+from typing import List
+
+
+class Solution:
+    def xorAllNums(self, nums1: List[int], nums2: List[int]) -> int:
+        x = 0
+        if len(nums1) & 1 != 0:
+            x = reduce(xor, nums2)
+        if len(nums2) & 1 != 0:
+            x ^= reduce(xor, nums1)
+        return x
+
+
+def main():
+    nums1 = [2, 1, 3]
+    nums2 = [10, 2, 5, 0]
+    assert Solution().xorAllNums(nums1, nums2) == 13
+
+    nums1 = [1, 2]
+    nums2 = [3, 4]
+    assert Solution().xorAllNums(nums1, nums2) == 0
+
+
+if __name__ == '__main__':
+    main()

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

@@ -18,7 +18,7 @@
 | 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 | [2429. Minimize XOR](https://leetcode.com/problems/minimize-xor/) | Medium | Unsolved |
-| January 16 | []() |  |  |
+| January 16 | [2425. Bitwise XOR of All Pairings](https://leetcode.com/problems/bitwise-xor-of-all-pairings/) | Medium | Solved |
 | January 17 | []() |  |  |
 | January 18 | []() |  |  |
 | January 19 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 11 | 9 | 2 |
+| Medium | 12 | 10 | 2 |
 | Hard   | 0 | 0 | 0 |