Given a binary string s, return the count of non-empty substrings that satisfy both of the following conditions:

• The substring contains an equal number of '0's and '1's.

• All '0's and all '1's within the substring are grouped consecutively (i.e., no interleaving of the two characters).

Substrings that appear multiple times are counted once for each occurrence.

Constraints:

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

• s[i] is either '0' or '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.