You are given two $0$ indexed integer arrays, nums1 and nums2.

Consider a list containing the bitwise XOR of every possible pair ( nums1[i] $\oplus$ nums2[j] ), where $0 \leq i <$ nums1.length and $0 \leq j <$ nums2.length.

Return the bitwise XOR of all the integers in this list.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 10^5$

• $0 \leq$ nums1[i], nums2[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.