Merge pull request neetcode-gh#2660 from akxavier/akxavier-patch-1

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

Author: tahsintunan

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

@@ -1,8 +1,7 @@
 class Solution:
     def characterReplacement(self, s: str, k: int) -> int:
         count = {}
-        res = 0
-
+        
         l = 0
         maxf = 0
         for r in range(len(s)):
@@ -13,5 +12,4 @@ def characterReplacement(self, s: str, k: int) -> int:
                 count[s[l]] -= 1
                 l += 1
 
-            res = max(res, r - l + 1)
-        return res
+        return (r - l + 1)