Longest Repeating Character Replacement

Given an uppercase string and integer k, you may replace at most k characters. Print the length of the longest substring that can be made of one repeated character. Input format: - First line: s - Second line: k

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

ABAB
2

4

AABABBA
1

4