# Minimum XOR Sum Of Two Arrays: Interview Notes
Minimum XOR Sum Of Two Arrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Bitmask DP over which nums2 elements are used: dp[mask] for assigning the first popcount(mask) elements of nums1.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n * 2^n).
## Common mistake
Greedy pairing by sorted order, which is wrong for XOR.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.