Package g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    395 - Longest Substring with At Least K Repeating Characters\.

    Medium

    Given a string s and an integer k, return the length of the longest substring of s such that the frequency of each character in this substring is greater than or equal to k.

    Example 1:

    Input: s = "aaabb", k = 3

    Output: 3

    Explanation: The longest substring is "aaa", as 'a' is repeated 3 times.

    Example 2:

    Input: s = "ababbc", k = 2

    Output: 5

    Explanation: The longest substring is "ababb", as 'a' is repeated 2 times and 'b' is repeated 3 times.

    Constraints:

    • <code>1 <= s.length <= 10<sup>4</sup></code>

    • s consists of only lowercase English letters.

    • <code>1 <= k <= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer longestSubstring(String s, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait