Longest Repeating Character Replacement - Read Statement

Given a string s and integer $k$, you can replace at most $k$ characters to make any substring contain only one repeating character. Return the length of the longest such substring.

Example: For "AABABBA" and $k=1$, return $4$. Replace one A in "ABAB" to get "AAAA" or "BBBB".