LeetCode 0395 - Longest Substring with At Least K Repeating Characters
Longest Substring with At Least K Repeating Characters
Desicription
Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than k times.
Example 1:
1 | Input: |
Example 2:
1 | Input: |
Solution
1 | class Solution { |