Jira Ticket: LND-127
LeetCode: https://leetcode.com/problems/longest-repeating-character-replacement
Pattern: Sliding Window
Difficulty: Medium
Status: To Do
Priority: Medium
Labels: Medium, Sliding_Window
Created: 2025-08-21
Last Updated: 2025-08-22
Problem URL: https://leetcode.com/problems/longest-repeating-character-replacement 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 Explanation: Replace the one 'A' in the middle with 'B' and form "AABBBBA". The substring "BBBB" has the longest repeating letters, which is 4. Constraints: 1 <= s.length <= 10^5 s consists of only uppercase English letters. 0 <= k <= s.length Difficulty: Medium Category: Sliding Window
- What are we asked to find/compute?
- What are the inputs and outputs?
- What are the edge cases?
Time Complexity: O(?)
Space Complexity: O(?)
Algorithm Steps: 1. 2. 3.
Time Complexity: O(?)
Space Complexity: O(?)
Example:
Step 1:
Step 2:
Step 3:
# Your solution here
def solution():
passInput:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
Input:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
Input:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
- When to use sliding window:
- When NOT to use this pattern:
- Pattern Guide
- LeetCode Discussion: https://leetcode.com/problems/longest-repeating-character-replacement/discuss/
- Problem understood
- Pattern identified
- Brute force solution
- Optimized solution
- All test cases pass
- Complexity analyzed
- Code reviewed
- Learnings documented
- Jira ticket updated
Status: 🔴 Not Started
Last Updated: 2025-08-22