Given a string s and integers maxLetters, minSize, and maxSize, consider all substrings of s whose length is between minSize and maxSize inclusive. A substring is valid if it contains at most maxLetters distinct characters.

Return the maximum number of times any valid substring occurs in s.

Note: Occurrences of a substring may overlap.

Constraints:

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

• $1 \leq$ maxLetters $\leq 26$

• $1 \leq$ minSize $\leq$ maxSize $\leq \min(26,\\ ext{`s.length`})$

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