# Maximum Difference By Remapping A Digit: Explained
Maximum Difference By Remapping A Digit shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Remap one digit x to y (every occurrence) to maximize the difference between the maximized and minimized versions of num? The usual statement: return the value after remapping to maximize num itself? Check: LeetCode 2566 asks for max - min after each using one remapping. Maximize by mapping the first non-9 to 9; minimize by mapping the first digit to 0 (or the first non-zero if leading-zero is allowed — 2566 allows the min to have leading zeros, effectively mapping the first digit to 0). Return maxMapped - minMapped.
## 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(d).
## Common mistake
Using the same mapping for both max and min, or refusing a leading-zero on the minimized number when the problem allows it.
## 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 www.linkjob.ai.