# Paint House: Study Guide
Paint House shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
n houses, 3 colors; adjacent houses cannot share a color; cost[i][j] to paint house i color j. DP: dp[i][c] = cost[i][c] + min(dp[i-1][other colors]). Answer is min of the last row. Can be done with 3 rolling variables.
## 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).
## Common mistake
Taking the global min color every house (which can repeat a color) instead of excluding the previous choice.
## 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 AI interview copilot.