Time: 136 ms (17.29%) | Memory: 16.6 MB (80.27%) - LeetSync

swolecoder · swolecoder · commit ac674d5d0e04 · 2024-06-12T14:35:16.000-07:00
diff --git a/424-longest-repeating-character-replacement/longest-repeating-character-replacement.py b/424-longest-repeating-character-replacement/longest-repeating-character-replacement.py
@@ -1,16 +1,21 @@
 class Solution:
     def characterReplacement(self, s: str, k: int) -> int:
-        map = {}
-        l = 0
-        res = 0
 
-        for i in range(len(s)):
-            map[s[i]] = map.get(s[i], 0) + 1
+        left = 0
+        map = defaultdict(int)
+        ans = 0
 
-            if (i - l +1) - max(map.values()) > k:
-                map[s[l]] = map[s[l]] -1
-                l +=1
+        for right in range(len(s)):
+            map[s[right]] = map.get(s[right], 0) +1
+            while (right -left +1) - max(map.values()) > k:
+                map[s[left]] -=1
+                if map[left] == 0:
+                    del map[left]
+                left +=1
             
-            res = max(res, i-l +1)
-        return res 
-        
+            
+            ans = max(ans, right -left +1)
+        return ans
+
+
+
