palindromic substrings

Author: eunhwa99

longest-repeating-character-replacement/eunhwa99.java

@@ -0,0 +1,24 @@
+class Solution{
+    public int characterReplacement(String s, int k) {
+        int[] count = new int[26];
+        int maxCount = 0;
+        int left = 0;
+        int result = 0;
+
+        for (int right = 0; right < s.length(); right++) {
+            char currentChar = s.charAt(right);
+            count[currentChar - 'A']++;
+            maxCount = Math.max(maxCount, count[currentChar - 'A']);
+
+            while (right - left + 1 - maxCount > k) {
+                count[s.charAt(left) - 'A']--;
+                left++;
+            }
+
+            result = Math.max(result, right - left + 1);
+        }
+
+
+        return result;
+    }
+}