# Paint Fence: Study Guide

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

## Key idea

n posts and k colors; no more than two adjacent posts share a color. Let s[i] = ways the i-th post differs from i-1, d[i] = ways it matches i-1 (so i-1 must have differed from i-2). Then s[i]=(k-1)*(s[i-1]+d[i-1]) and d[i]=s[i-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).

## Common mistake

Forbidding any two adjacent equals (that is a different, easier recurrence) or allowing three in a row.

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