Leetcode 256. Paint House

Given an n×k cost matrix, choose a color for each house so that no two adjacent houses share the same color and the total painting cost is minimized; the core challenge is dynamic programming/optimization to compute the minimal total cost efficiently across k colors.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late September, 2025

Senior

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 256. Paint House

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact