Merge pull request #2969 from coopers/0424

Update 0424-longest-repeating-character-replacement.py

Author: sujal-goswami

python/0424-longest-repeating-character-replacement.py

@@ -1,15 +1,13 @@
 class Solution:
-    def characterReplacement(self, s: str, k: int) -> int:
-        count = {}
-        
-        l = 0
+    def characterReplacement(self, s, k):
+        counts = {}
         maxf = 0
-        for r in range(len(s)):
-            count[s[r]] = 1 + count.get(s[r], 0)
-            maxf = max(maxf, count[s[r]])
-
-            if (r - l + 1) - maxf > k:
-                count[s[l]] -= 1
+        l = 0
+        for r, ch in enumerate(s):
+            counts[ch] = 1 + counts.get(ch, 0)
+            maxf = max(maxf, counts[ch])
+            if maxf + k < r - l + 1:
+                counts[s[l]] -= 1
                 l += 1
 
-        return (r - l + 1)
+        return len(s) - l