Given a string s, find the number of good splits of the string.

A split is considered good if s is divided into two nonempty substrings p and q such that their concatenation forms s, and the number of distinct characters in p equals the number of distinct characters in q.

Return the total number of good splits of s.

Constraints:

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

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