You are given two integer arrays nums1 and nums2, each of length n.

The XOR sum of the two arrays is defined as:

(nums1[$0$] $\oplus$ nums2[$0$]) $+$ (nums1[$1$] $\oplus$ nums2[$1$]) $+$ $\dots$ $+$ (nums1[n $-$ $1$] $\oplus$ nums2[n $-$ $1$])

where $\oplus$ represents the bitwise XOR operation.

Rearrange the elements of nums2 such that the resulting XOR sum is minimized.

Return the minimum XOR sum achievable after rearranging nums2.

Constraints:

• n $==$ nums1.length

• n $==$ nums2.length

• $1 \leq$ n $\leq 14$

• $0 \leq$ nums1[i], nums2[i] $\leq 10^7$

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.