# Decode String: Interview Notes
Decode String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Two stacks (counts and strings) or recursion: on '[', push the current string and repeat count; on ']', pop and repeat the decoded chunk that many times.
## 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 * maxK).
## Common mistake
Multiplying only the next character instead of the whole bracketed substring.
## 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 interview assistant.