Maximum Number of Occurrences of a Substring

Given a string s, return the maximum number of occurrences of any substring under the following rules:

  • The number of unique characters in the substring must be less than or equal to maxLetters.
  • The substring size must be between minSize and maxSize inclusive.
Example 1
Inputs = "aababcaab", maxLetters = 2, minSize = 3, maxSize = 4
Output2
Substring "aab" has 2 occurrences in the original string, satisfies the conditions with 2 unique letters, and has size 3 between minSize and maxSize.
Example 2
Inputs = "aaaa", maxLetters = 1, minSize = 3, maxSize = 3
Output2
Substring "aaa" occurs 2 times in the string, and occurrences can overlap.

Constraints

  • 1 <= s.length <= 10^5
  • 1 <= maxLetters <= 26
  • 1 <= minSize <= maxSize <= min(26, s.length)
  • s consists of only lowercase English letters.

Asked at 6 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate