The string s has only uppercase letters. You may change at most k of its letters, and each changed letter can become any uppercase letter you like.
After the changes, some substrings are made of one repeated letter, such as "AAAA". Return the length of the longest such substring you can make.
Examples
Example 1:
Input: s = "BBABB", k = 1
Output: 5
Explanation: Change the A into B. The whole string becomes "BBBBB".
Example 2:
Input: s = "ABCDE", k = 2
Output: 3
Explanation: With 2 changes you can make 3 equal letters, for example "AAA" from "ABC". You cannot make 4.
Example 3:
Input: s = "AAAA", k = 0
Output: 4
Explanation: No change is needed.