> For the complete documentation index, see [llms.txt](https://jimmylin1991.gitbook.io/practice-of-algorithm-problems/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jimmylin1991.gitbook.io/practice-of-algorithm-problems/string/424.-longest-repeating-character-replacement.md).

# 424. 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.
```

```cpp
// Sliding window
int characterReplacement(string s, int k) { // time: O(n); space: O(1)
    int start = 0, end = 0, maxCount = 0, d = 0;
    vector<int> record(128, 0);
    while (end < s.length()) {
        maxCount = max(maxCount, ++record[s[end++]]);
        while (end - start - maxCount > k) {
            --record[s[start++]];
        }
        d = max(d, end - start);
    }
    return d;
}
```

```cpp
// Sliding Window for only uppercase character input
int characterReplacement(string s, int k) { // time: O(n); space: O(1)
    int begin = 0, end = 0, maxCnt = 0, res = 0;
    vector<int> record(26, 0);
    while (end < s.length()) {
        maxCnt = max(maxCnt, ++record[s[end++] - 'A']);
        // (end - begin - maxCnt) is # of the replacement operation required
        while (end - begin - maxCnt > k) --record[s[begin++] - 'A'];
        res = max(res, end - begin);
    }
    return res;
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://jimmylin1991.gitbook.io/practice-of-algorithm-problems/string/424.-longest-repeating-character-replacement.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.