Given an integer array arr, in each operation you can choose a palindromic subarray and remove it from arr. Once a subarray is removed, the remaining elements to its left and right are concatenated to form a single array.

Return the minimum number of operations required to completely remove all elements from arr.

Constraints:

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

• $1 \leq$ arr[i] $\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.