Given a string text, partition it into $k$ non empty substrings $(a_1, a_2, \dots, a_k)$ such that concatenating them sequentially forms text, and $a_i = a_{k - i + 1}$ holds for each $i$ from $1$ to $k$.

Return the maximum possible value of $k$.

Constraints:

• $1 \le$ text.length $\le 1000$

• text consists only of lowercase English characters.

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.