Bitwise XOR Of All Pairings In O(m + N) Time Complexity
Bitwise XOR of All Pairings: Return the bitwise XOR of all integers in nums3, where nums3 contains the XOR of all pairings between nums1 and nums2.
2425. Bitwise XOR of All Pairings Difficulty: Medium Topics: Array, Bit Manipulation, Brainteaser You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists another array, nums3, which contains the bitwise XOR of all pairings of integers between nums1 and nums2 (every integer in nums1 is paired with every integer in nums2 exactly once). Return the bitwise XOR of all integers in nums3. Example 1: Input: nums1 = [2,1,3], nums2 = [10,2,5,0] Output: 13 Explanation: A possible nums3 array is [8,0,7,2,11,3,4,1,9,1,6,3]. The bitwise XOR of all these numbe...