# Design Compressed String Iterator: Interview Notes
Design Compressed String Iterator shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Parse the string lazily: hold the current letter and its remaining count, and read the next letter plus multi-digit number only when the count hits zero.
## 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(1) amortized.
## Common mistake
Expanding the whole string, which explodes when counts are in the billions.
## 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.