You are given a string `s` of uppercase English letters and an integer `k`. You can choose any character of the string and change it to any other uppercase English letter. You can perform this operation at most `k` times.
Return the length of the longest substring containing the **same letter** you can get after performing the above operations.
Example 1
Input:s = "ABAB", k = 2
Output:4
Explanation:Replace the two 'A's with two 'B's or vice versa to get "BBBB" or "AAAA".
Example 2
Input:s = "AABABBA", k = 1
Output:4
Explanation:Replace the one 'A' in the middle with 'B' to form "AABBBBA". The substring "BBBB" has length 4.
Example 3
Input:s = "ABCDE", k = 1
Output:2
Explanation:With one replacement, the best you can do is a window of 2 (one kept letter plus one replaced).
Constraints
- 1 <= s.length <= 10^5
- s consists of only uppercase English letters.
- 0 <= k <= s.length