Leetcode 2425. Bitwise XOR of All Pairings

Compute the bitwise XOR of all pairwise XORs nums1[i] ^ nums2[j] for every i, j; use XOR's associativity and cancellation so the result depends only on the XOR of an array when the other array's length is odd, giving an O(n+m) solution suitable for large inputs.