๐ฉโ๐ซ
๐จโ๐ผ
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Free ยท No sign up ยท Early access
1Find Longest Substring with K Replacementsmedium
Based onLeetCode
mediumGrind 75
Longest Repeating Character Replacement
This one is the sliding window pattern: grow, shrink, and maintain just enough state to stay linear. Interviewers love it because it reveals your stateful scanning and your edge-case discipline. Once your window update rules are consistent, you get linear time almost for free.
Arrays & HashingStringTwo PointersSliding Window
๐ฉโ๐ซ
๐จโ๐ผ
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Free ยท No sign up ยท Early access
1Find Longest Substring with K Replacementsmedium
Based onLeetCode
Get this problem sent to your inbox