Section 1Understand Problem
Section 01
Understand the problem
Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.
Problem statement
There is a row of `n` houses; each house can be painted red, blue, or green. The cost of painting each house with each color is given by an `n x 3` cost matrix. Two adjacent houses cannot be painted the same color. Return the minimum total cost to paint all houses.
Example
costs = [[17,2,17],[16,16,5],[14,3,19]] → 10
Constraints
0 ≤ n ≤ 100 · 0 ≤ costs[i][k] ≤ 20
Audio recording unsupported on this browser.
WPM—Fillers0Pace—Thinking0%
Explain the problem in your own words
0 words0 chars
AI Review
Write your thinking above first.
Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.
Ready to submit Section 1?
The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.
Write at least a couple of sentences explaining the problem before submitting.