Given a string s that consists only of the characters 'a', 'b', and 'c', return the number of substrings that contain at least one occurrence of each of the three characters.

Constraints:

• $3 \leq$ s.length $\leq 5 \times 10^4$

• s consists only of characters 'a', 'b', or '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.