# Maximum XOR With An Element From Array: Explained

Maximum XOR With An Element From 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 nums, offline-sort queries by m and insert nums <= m as you go, then query the opposite-bit path for each xi.

## 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+q) log A).

## Common mistake

Answering each query with a scan of nums.

## 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 AI tool for job interviews.