Given a string s, partition it into one or more substrings such that no character appears more than once in any single substring.

Return the minimum number of substrings required to obtain such a partition.

Note: Each character in s must belong to exactly one substring in the partition.

Constraints:

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

• 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.