# Paint House II: Interview Notes
Paint House II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
n houses and k colors; cost[i][j] to paint house i color j, no two adjacent the same. Track the smallest and second-smallest costs of the previous row (and the color of the smallest) so each cell of the next row picks the best legal previous in O(1).
## 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 k).
## Common mistake
Rescanning the whole previous row for every color (O(n k^2)) or allowing two neighbors the same color.
## 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.