You are given an integer array boxes where each element represents the color of a box.

You can perform multiple rounds of box removal until no boxes remain. In each round, you can select a contiguous sequence of $k$ boxes ($k \geq 1$) that all share the same color, remove them, and earn $k imes k$ points.

Return the maximum total points you can obtain.

Constraints:

• $1 \leq$ boxes.length $\leq 100$

• $1 \leq$ boxes[i] $\leq 100$

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.