# Paint House III: Interview Notes

Paint House III shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DP[i][t][c] = min cost to paint the first i houses using exactly t neighborhoods, with house i-1 colored c. Transitions either continue the same color (t unchanged) or start a new neighborhood (t+1) with a different color.

## 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(m * n^2 * target).

## Common mistake

Ignoring that consecutive houses of the same color share one neighborhood, which miscounts t.

## 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 this tool.