# Number Of Ways To Paint N x 3 Grid: Walkthrough

Number Of Ways To Paint N x 3 Grid shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Color a 3-wide grid with 3 colors so no two adjacent cells (including vertical) match. A column coloring is a triple of colors with no two vertical neighbors equal; precompute compatible pairs of column states and DP[i][state] along the n columns. Mod 10^9+7.

## 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 * S^2) with S<= 3*2*2=12.

## Common mistake

Coloring cells independently per row and missing the vertical constraint between columns.

## 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 try it free.