# Strange Printer: Walkthrough
Strange Printer shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Interval DP on runs of equal characters: dp[i][j] is min turns to print s[i:j]. A matching s[i]==s[k] lets you reuse the same turn across the gap.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) 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^3).
## Common mistake
Printing each run independently, which overcounts when two equal runs can share a turn.
## 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 learn more.