Given a string s of lowercase English letters, find the maximum number of non overlapping substrings that meet the following criteria:

• If a character appears in a chosen substring, all occurrences of that character in s must also be contained within that same substring.

• No two chosen substrings may overlap.

If there are multiple valid collections of substrings that achieve the maximum possible count, return the one that minimizes the total sum of their lengths. The substrings may be returned in any order.

Constraints:

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

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