224. Longest Repeating Character Replacement

Given a string s and integer k, you may change at most k characters to any uppercase letter. Return the length of the longest substring containing a single repeated letter achievable after the changes. Input: '"s", k'.

Input: '"s", k'.

Output: Integer — longest achievable repeating substring.

Examples

Input: "ABAB", 2
Output: 4
Explanation: Change 2 to make 'AAAA' or 'BBBB'.

Input: "AABABBA", 1
Output: 4
Explanation: Window 'AABA'->'AAAA'.

Input: "AAAA", 0
Output: 4
Explanation: Already all same.

Constraints

• 1<=s.length<=10^5
• 0<=k<=s.length
• uppercase letters

Asked by