Merge pull request #2567 from sangbeenmoon/week8

[sangbeenmoon] WEEK 08 Solutions

Author: sangbeenmoon

longest-repeating-character-replacement/sangbeenmoon.py

@@ -0,0 +1,16 @@
+class Solution:
+    def characterReplacement(self, s: str, k: int) -> int:
+        freq = {}
+        left = 0
+        ans = 0
+
+        for right in range(len(s)):
+            freq[s[right]] = freq.get(s[right], 0) + 1
+            
+            while (right - left + 1) - max(freq.values()) > k:
+                freq[s[left]] -= 1
+                left += 1
+            
+            ans = max(ans, right - left + 1)
+
+        return ans