java.lang.Object
g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters.Solution

public class Solution extends Object
395 - Longest Substring with At Least K Repeating Characters.<p>Medium</p> <p>Given a string <code>s</code> and an integer <code>k</code>, return <em>the length of the longest substring of</em> <code>s</code> <em>such that the frequency of each character in this substring is greater than or equal to</em> <code>k</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;aaabb&rdquo;, k = 3</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> The longest substring is &ldquo;aaa&rdquo;, as &lsquo;a&rsquo; is repeated 3 times.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;ababbc&rdquo;, k = 2</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> The longest substring is &ldquo;ababb&rdquo;, as &lsquo;a&rsquo; is repeated 2 times and &lsquo;b&rsquo; is repeated 3 times.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 10<sup>4</sup></code></li> <li><code>s</code> consists of only lowercase English letters.</li> <li><code>1 <= k <= 10<sup>5</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • longestSubstring

      public int longestSubstring(String s, int k)