> For the complete documentation index, see [llms.txt](https://protegejj.gitbook.io/algorithm-practice/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/interval-dp/546-removeboxes.md).

# 546     Remove Boxes

## 546. [Remove Boxes](https://leetcode.com/problems/remove-boxes/description/)

## 1. Question

Given several boxes with different colors represented by different positive numbers.\
You may experience several rounds to remove boxes until there is no box left. Each time you can choose some continuous boxes with the same color (composed of k boxes, k >= 1), remove them and get`k*k`points.\
Find the maximum points you can get.

**Example 1:**\
Input: \[1, 3, 2, 2, 2, 3, 4, 3, 1]

Output: 23

**Explanation**:

```
[1, 3, 2, 2, 2, 3, 4, 3, 1] ----> [1, 3, 3, 4, 3, 1] (3*3=9 points) 
----> [1, 3, 3, 3, 1] (1*1=1 points) 
----> [1, 1] (3*3=9 points) 
----> [] (2*2=4 points)
```

**Note:** The number of boxes`n`would not exceed 100.

## 2. Implementation

**(1) DP**

```
```

## 3. Time & Space Complexity