# Largest Number After Mutating Substring: Walkthrough
Largest Number After Mutating Substring shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
change[d] says what digit d (0-9) may become. You may mutate one contiguous substring, and you want the lexicographically largest number. Scan left-to-right, start mutating at the first digit that strictly increases, continue while change[d] >= d, then stop (do not resume). Never mutate if nothing increases.
## 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
Mutating every digit independently (the substring must be contiguous) or continuing after a decrease, which can hurt a later larger prefix.
## 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 real-time AI interview assistant for live interviews.