Longest Repeating Character Replacement

Try to solve the Longest Repeating Character Replacement problem.

We'll cover the following

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.

Constraints:

  • 1≤1 \leq s.length ≤103\leq 10^3

  • s consists of only uppercase English characters.

  • 0≤0 \leq k ≤\leq s.length

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy