170125

Author: aluferraz

leetcode/editor/en/Q2425/BitwiseXorOfAllPairings.py

@@ -0,0 +1,27 @@
+from collections import defaultdict
+from typing import List
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def xorAllNums(self, nums1: List[int], nums2: List[int]) -> int:
+        ans = 0
+        l1, l2 = len(nums1), len(nums2)
+        f = defaultdict(int)
+
+        for i in nums1:
+            f[i] += l2
+        for i in nums2:
+            f[i] += l1
+
+        for i in f:
+            if f[i] % 2 != 0:
+                ans = ans ^ i
+        return ans
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class BitwiseXorOfAllPairings(Solution):
+    pass

leetcode/editor/en/Q2683/NeighboringBitwiseXor.py

@@ -0,0 +1,31 @@
+from functools import cache
+from typing import List
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def doesValidArrayExist(self, derived: List[int]) -> bool:
+        N = len(derived)
+
+        @cache
+        def go(i, must_be):
+            if i == N:
+                return derived[0] == must_be
+            if derived[i] == 1:
+                if must_be == 0:
+                    return go(i + 1, 1)
+                else:
+                    return go(i + 1, 0)
+
+            if must_be == 0:
+                return go(i + 1, 0)
+            return go(i + 1, 1)
+
+        return go(0, derived[0])
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class NeighboringBitwiseXor(Solution):
+    pass

main.py

@@ -1,4 +1,4 @@
-from leetcode.editor.en.Q2429.MinimizeXor import MinimizeXor
+from leetcode.editor.en.Q2683.NeighboringBitwiseXor import NeighboringBitwiseXor
 
 if __name__ == '__main__':
-    print(MinimizeXor().minimizeXor(2, 5))
+    print(NeighboringBitwiseXor().doesValidArrayExist(derived=[1, 0]))