Longest Repeating Character Replacement

Given a string s that consists of only uppercase English letters, you can perform at most k operations on that string.

In one operation, you can choose any character of the string and change it to any other uppercase English character.

Find the length of the longest sub-string containing all repeating letters you can get after performing the above operations.

Note:
Both the string's length and k will not exceed 104.

Example 1:

Input:
s = "ABAB", k = 2

Output:
4

Explanation:
Replace the two 'A's with two 'B's or vice versa.

Example 2:

Input:
s = "AABABBA", k = 1

Output:
4

Explanation:
Replace the one 'A' in the middle with 'B' and form "AABBBBA".
The substring "BBBB" has the longest repeating letters, which is 4.

Solution

Solution 1: Sliding window

class Solution:
    def characterReplacement(self, s: str, k: int) -> int:
        # Time complexity: O(n).
        # Space complexity: O(26) ~ O(1).
        n = len(s)
        char_freqs = [0] * 26
        beg = 0
        max_length = 0 
        max_freq = 0 # maximum char frequency within window size.
        
        for end in range(n):
            char_freqs[ord(s[end]) - ord('A')] += 1
            freq = char_freqs[ord(s[end]) - ord('A')]
            max_freq = max(max_freq, freq)
            
            while end - beg + 1 - max_freq > k:
                char_freqs[ord(s[beg]) - ord('A')] -= 1
                beg += 1
            
            max_length = max(max_length, end - beg + 1)
            
        return max_length