Given a string s consisting of zeros and ones, divide it into two non-empty substrings, left and right, such that their concatenation equals s.

The score of a split is defined as the total count of zeros in left plus the total count of ones in right.

Return the maximum score achievable across all possible splits.

Constraints:

• $2 \leq$ s.length $\leq 500$

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

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.