java.lang.Object
g1201_1300.s1297_maximum_number_of_occurrences_of_a_substring.Solution

public class Solution extends Object
1297 - Maximum Number of Occurrences of a Substring.<p>Medium</p> <p>Given a string <code>s</code>, return the maximum number of ocurrences of <strong>any</strong> substring under the following rules:</p> <ul> <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> inclusive.</li> </ul> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;aababcaab&rdquo;, maxLetters = 2, minSize = 3, maxSize = 4</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Substring &ldquo;aab&rdquo; has 2 ocurrences in the original string.</p> <p>It satisfies the conditions, 2 unique letters and size 3 (between minSize and maxSize).</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;aaaa&rdquo;, maxLetters = 1, minSize = 3, maxSize = 3</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Substring &ldquo;aaa&rdquo; occur 2 times in the string. It can overlap.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 10<sup>5</sup></code></li> <li><code>1 <= maxLetters <= 26</code></li> <li><code>1 <= minSize <= maxSize <= min(26, s.length)</code></li> <li><code>s</code> consists of only lowercase English letters.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • maxFreq

      public int maxFreq(String s, int max, int minSize, int maxSize)