You are given a string s consisting only of the characters 'a' and 'b'.

In a single operation, you can remove any palindromic subsequence from s.

Return the minimum number of operations required to make s completely empty.

Note: A subsequence is derived from a string by deleting $0$ or more characters without altering the relative order of the remaining characters. A string is considered a palindrome if it reads identically from left to right and from right to left.

Constraints:

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

• s[i] is either 'a' or 'b'.

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.