Balanced strings are strings that contain an equal count of 'L' and 'R' characters.

Given a balanced string s, partition it into the maximum possible number of balanced substrings.

Return the maximum number of balanced substrings that can be obtained from the split.

Constraints:

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

• s[i] is either 'L' or 'R'

• s is a balanced string

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.