Longest Repeating Character Replacement | Dataford Interview Questions

Longest Repeating Character Replacement (LeetCode 424)

Asked in the DSA round stage. Given a string s containing uppercase English letters and an integer k, return the length of the longest substring that can be converted into a string of identical characters by replacing at most k characters.

Contract

Implement def characterReplacement(s, k):. Return an integer.

Constraints

1 <= len(s) <= 10^4
s contains only uppercase English letters
0 <= k <= len(s)

Function Signature

def characterReplacement(s, k):

Your question is Longest Repeating Character Replacement. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem