The XOR sum of an array is defined as the bitwise XOR of all its elements (evaluating to $0$ for an empty array).

Given two integer arrays arr1 and arr2, consider a list constructed by taking the bitwise AND operation between every element arr1[i] and every element arr2[j], for all $0 \leq i <$ arr1.length and $0 \leq j <$ arr2.length.

Return the XOR sum of this constructed list.

Constraints:

• $1 \leq$ arr1.length, arr2.length $\leq 10^5$

• $0 \leq$ arr1[i], arr2[j] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.