A string is considered good if all of its characters are distinct.

Given a string s, return the total number of good substrings of length $3$ contained in s.

Note: If a good substring occurs multiple times, each instance is counted separately.

Constraints:

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

• s consists of 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.