There is a row of $n$ houses, where each house can be painted with one of the $k$ colors. The cost of painting each house with a specific color is represented by an $n imes k$ cost matrix costs, where costs[i][j] represents the cost of painting house i with color j.

All houses must be painted such that no two adjacent houses have the same color.

Return the minimum total cost required to paint all houses.

Constraints:

• costs.length $== n$

• costs[i].length $== k$

• $1 \leq n \leq 100$

• $2 \leq k \leq 20$

• $1 \leq$ costs[i][j] $\leq 20$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.