# Strange Printer II: Walkthrough

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

## Key idea

A grid was painted color by color, each color as an axis-aligned rectangle (later colors overwrite). For each color infer its bounding box; if some other color sits inside it, that other color must be printed later — build that dependency graph and reject a cycle.

## 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((mn)^2) or better with topo.

## Common mistake

Assuming colors never overwrite, or treating any overlapping cells as a conflict without a print order.

## 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 https://linkjob.ai.