g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters

Class Solution

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.

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:

• 1 <= s.length <= 104
• s consists of only lowercase English letters.
• 1 <= k <= 105

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

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

Methods inherited from class java.lang.Object

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

Constructor Detail

Solution

public Solution()

Method Detail

longestSubstring

public int longestSubstring(String s,
                            int k)