2022-03-27 20:56:26 +08:00
< 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 >
2023-12-09 18:42:21 +08:00
< p data-pm-slice = "1 1 []" > if no such substring exists, return 0.< / p >
2022-03-27 20:56:26 +08:00
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< pre >
< strong > Input:< / strong > s = " aaabb" , k = 3
< strong > Output:< / strong > 3
< strong > Explanation:< / strong > The longest substring is " aaa" , as ' a' is repeated 3 times.
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< pre >
< strong > Input:< / strong > s = " ababbc" , k = 2
< strong > Output:< / strong > 5
< strong > Explanation:< / strong > The longest substring is " ababb" , as ' a' is repeated 2 times and ' b' is repeated 3 times.
< / pre >
< p > < / 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 >
