LeetCode 424: Longest Repeating Character Replacement

[github-actions]

LeetCode 424: Longest Repeating Character Replacement

Category: String
Difficulty: See LeetCode
Solution File: src/string/longest_repeating_character_replacement.py
Test File: tests/test_longest_repeating_character_replacement.py

Problem Description

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
Explanation: Replace the two 'A's with two 'B's or vice versa.

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

Constraints:

• 1 <= s.length <= 10^5
• s consists of only uppercase English letters.
• 0 <= k <= s.length

Tasks

• Implement the solution in src/string/longest_repeating_character_replacement.py
• Ensure all test cases pass
• Analyze time complexity
• Analyze space complexity