# Maximum Strong Pair XOR II: Walkthrough

Maximum Strong Pair XOR II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A strong pair satisfies |x-y| <= min(x,y), i.e. the two numbers lie in a factor-of-two window. Slide a window on the sorted array and query a bitwise trie of the window.

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

## Common mistake

Checking the strong condition after taking a global maximum XOR pair.

## 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 try it free.