Available question text
Given an even-length row of n houses and a cost matrix for 3 colors, find the minimum total painting cost such that no two adjacent houses share a color and no pair of houses equidistant from the ends share a color. This is a constrained DP problem that enforces both local adjacency and mirrored (palindromic) constraints across the row.
Related questions
Continue with questions that share topics or the same question type.
- Paint House
Coding
- Paint House II
Coding
- Paint House III
Coding
- House Robber
Coding · Array · Dynamic Programming
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 3429. Paint House IV
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source