# Remove Duplicate Letters: Walkthrough

Remove Duplicate Letters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Greedy monotonic stack: count remaining frequencies; skip a letter already in the stack; pop a larger top when it still appears later, so the result is the smallest subsequence with every letter once.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Sorting the unique letters, which loses the original relative order the subsequence must keep.

## 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 the Linkjob AI app.