Leetcode 265. Paint House II

Given n houses and k paint colors with a cost matrix, choose a color for each house so no two adjacent houses share a color and the total painting cost is minimized. The challenge is to design an efficient DP that handles large k (avoid naive O(n·k²)), typically by carrying forward the best and second-best previous costs to achieve O(n·k) time.