Reference: LeetCode
Difficulty: Easy

Twitter OA 2019 | Coloring the blocks

## Problem

There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certain color is different. You have to paint all the houses such that no two adjacent houses have the same color.

The cost of painting each house with a certain color is represented by a n x 3 cost matrix. For example, costs is the cost of painting house 0 with color red; costs is the cost of painting house 1 with color green, and so on… Find the minimum cost to paint all houses.

Note: All costs are positive integers.

Example:

## Analysis

### DP

• Define: dp[i][j] is the minimum cost of painting i-th house with color j.
• Recurrence: (3 states)
• dp[i] = min(dp[i-1], dp[i-1]) + costs[i]
• dp[i] = min(dp[i-1], dp[i-1]) + costs[i]
• dp[i] = min(dp[i-1], dp[i-1]) + costs[i]
• Init:
• dp = cost[i]
• dp = cost[i]
• dp = cost[i]

Time: $O(N)$
Space: $O(N)$

Comment Junhao Wang
Hi, I was a master student at USC studying Computer Science.