Longest Repeating Character Replacement · Coding Interview Practice

Longest Repeating Character ReplacementGiven a string and an integer k, you may replace up to k characters. Return the length of the longest substring of a single repeating character.Constraints

1 <= s.length <= 10^5

s consists of only uppercase English letters

0 <= k <= s.length

Examples

Input: s = "ABAB", k = 2 Output: 4

Input: s = "AABABBA", k = 1 Output: 4

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…