Available question text
Count the number of ways to color an n×3 grid with 3 colors so that no two adjacent cells (horizontally or vertically) share a color, returning the result modulo 10^9+7. This is solved by dynamic programming over rows: there are 12 valid color patterns per row and you count transitions between patterns that avoid column-wise color matches.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1411. Number of Ways to Paint N × 3 Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source