# Remove K Digits: Walkthrough
Remove K Digits shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build an increasing digit stack: pop a previous larger digit while k remains, then drop leftover k from the tail and strip leading zeros.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Removing the k largest digits without respecting left-to-right order, which does not give the smallest number.
## 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.