You are given a string s consisting of lowercase English letters.

In one operation, you can:

1. Delete the first i letters of s (where $1 \leq$ i $\leq$ s.length $/ 2$) if the first i letters are equal to the next i letters.

2. Delete the entire string s.

Return the maximum number of operations required to completely delete s.

Constraints:

• $1 \leq$ s.length $\leq 4000$

• s consists only of lowercase English letters.

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.