Leetcode 424. Longest Repeating Character Replacement

Find the length of the longest substring that can be turned into all the same letter by performing at most k character replacements; this is typically solved with a sliding-window and frequency counts, expanding the window while ensuring window_size - max_char_count <= k.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early October, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 424. Longest Repeating Character Replacement

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact