Given a string s consisting only of the characters 'a', 'b', and 'c', return the length of the longest balanced substring in s.

A substring is considered balanced if all distinct characters that appear within it have the same frequency.

Constraints:

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

• s contains only the 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.