Given a string, s, and an integer, k, find the length of the longest substring in s, where all characters are identical, after replacing, at most, k characters with any other uppercase English character.
Constraints:
1≤s.length≤103
s consists of only uppercase English characters.
...
⋮
Tap here to switch tabs
Problem
Ask
Submissions
Solution
Solution: Longest Repeating Character Replacement
Statement▼
Given a string, s, and an integer, k, find the length of the longest substring in s, where all characters are identical, after replacing, at most, k characters with any other uppercase English character.