Given a binary string s, return the total number of prefixes of s that can be rearranged to form an alternating binary string.

An alternating string is defined as a string where no two adjacent characters are identical.

Constraints:

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

• s consists only of the characters $'0'$ and $'1'$.

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.