Min XOR Sum of Two Arrays

Two equal-length arrays are given. You may permute the second array arbitrarily. After pairing elements at matching positions, compute the sum of nums1[i] ^ nums2[i] across all positions. Find the minimum possible sum achievable by rearranging the second array.

Examples
Input: [[1,2],[2,3]]
Output: 2
Hints

Min XOR Sum of Two Arrays

Two equal-length arrays are given. You may permute the second array arbitrarily. After pairing elements at matching positions, compute the sum of `nums1[i] ^ nums2[i]` across all positions. Find the minimum possible sum achievable by rearranging the second array.