Longest Repeating Character Replacement
You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the length of the longest substring containing the same letter you can get after performing the above operations.

30:00

Longest Repeating Character Replacement
medium
Topics
Companies

You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the length of the longest substring containing the same letter you can get after performing the above operations.

Example 1:
Input: {"s":"ABAB","k":2}
Output: 4
Constraints:

  • 1≤s.length≤1051 \leq s.\text{length} \leq 10^5

  • s consists of only uppercase English letters.

  • 0≤k≤s.length0 \leq k \leq s.\text{length}

Input
arr ={"s":"ABAB","k":2}

Start

A

L

B

A

B

Counts
Max Freq
0
Max Length
0
Variables
No variables to display
DepthFunction Call
Stack empty
0/17