README_EN.md

1297. Maximum Number of Occurrences of a Substring

中文文档

Description

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

<li>The number of unique characters in the substring must be less than or equal to <code>maxLetters</code>.</li>

<li>The substring size must be between <code>minSize</code> and <code>maxSize</code>&nbsp;inclusive.</li>

 

Example 1:

Input: s = "aababcaab", maxLetters = 2, minSize = 3, maxSize = 4

Output: 2

Explanation: Substring "aab" has 2 ocurrences in the original string.

It satisfies the conditions, 2 unique letters and size 3 (between minSize and maxSize).

Example 2:

Input: s = "aaaa", maxLetters = 1, minSize = 3, maxSize = 3

Output: 2

Explanation: Substring "aaa" occur 2 times in the string. It can overlap.

Example 3:

Input: s = "aabcabcab", maxLetters = 2, minSize = 2, maxSize = 3

Output: 3

Example 4:

Input: s = "abcde", maxLetters = 2, minSize = 3, maxSize = 3

Output: 0

 

Constraints:

<li><code>1 &lt;= s.length &lt;= 10^5</code></li>

<li><code>1 &lt;= maxLetters &lt;= 26</code></li>

<li><code>1 &lt;= minSize &lt;= maxSize &lt;= min(26, s.length)</code></li>

<li><code>s</code> only contains lowercase English letters.</li>

Solutions

Python3

Java

...