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.