# Strange Printer: Study Guide

Strange Printer shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DP[l][r] = min turns to print s[l..r]. A turn can print a whole run of s[l]; then try every k where s[k]==s[l] and combine dp[l][k-1] + dp[k+1][r], because that later matching letter can ride along in the same turn.

## 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(n^3).

## Common mistake

Printing one character per turn or only merging immediately adjacent equals and missing a later matching letter.

## 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 interview copilot app.