You are given a string s.

A prefix of s is called a residue prefix if the number of distinct characters in the prefix is equal to the length of the prefix modulo $3$.

Return the total number of residue prefixes of s.

Constraints:

• $1 \leq$ s.length $\leq 100$

• s contains only lowercase English letters.

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.