Given a string s consisting only of characters 'a', 'b', and 'c'.

You can apply the following operation on the string any number of times:
$1$. Select a non empty prefix where all characters are identical.
$2$. Select a non empty suffix where all characters are identical.
$3$. Ensure that the prefix and suffix do not overlap at any index.
$4$. Ensure that the character in the prefix matches the character in the suffix.
$5$. Delete both the selected prefix and suffix from s.

Return the minimum possible length of s after applying this operation any number of times.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s only consists of characters 'a', 'b', and 'c'.

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.