557. Longest Substring with At Most K Replacements

Given a string s of uppercase letters and an integer k, you may replace at most k characters with any uppercase letters. Return the length of the longest substring containing a single repeated letter achievable after the replacements. The input is JSON {s, k}.

Input: JSON {s, k}.

Output: Integer — the longest achievable run length.

Examples

Input: {"s":"AABABBA","k":1}
Output: 4
Explanation: Replace one character to get a run of 4.

Input: {"s":"ABAB","k":2}
Output: 4
Explanation: Two replacements unify the string.

Input: {"s":"AAAA","k":0}
Output: 4
Explanation: Already uniform.

Constraints

• 1<=len(s)<=10^5
• 0<=k<=len(s)

Asked by