Given a string s, partition it into the minimum number of substrings such that every distinct character in each substring appears with the exact same frequency.

Return the minimum number of substrings obtained in such a valid partition.

Constraints:

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

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