# Maximum Swap: Interview Notes

Maximum Swap shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Record the last index of each digit 0-9. Scan left to right and try to swap with the largest digit that appears to the right; take the leftmost such improvement.

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

## Common mistake

Trying every pair, or swapping with the first larger digit instead of the largest.

## 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.