# Maximum XOR Of Two Numbers In An Array: Interview Notes

Maximum XOR Of Two Numbers In An Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build a bitwise trie of the numbers (or grow prefixes from MSB to LSB) and at each bit greedily try to take the opposite bit if a matching prefix exists.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(32n).

## Common mistake

Checking every pair, which is too slow for n up to 2e5.

## 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 Linkjob AI interview assistant.