Nov 20

Author: siddydutta

2024-11-November-LeetCoding-Challenge/README.md

@@ -22,7 +22,7 @@
 | November 17 | [862. Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/) | Hard | Solved |
 | November 18 | [1652. Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/) | Easy | Solved |
 | November 19 | [2461. Maximum Sum of Distinct Subarrays With Length K](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/) | Medium | Solved |
-| November 20 | []() |  |  |
+| November 20 | [2516. Take K of Each Character From Left and Right](https://leetcode.com/problems/take-k-of-each-character-from-left-and-right/) | Medium | Solved |
 | November 21 | []() |  |  |
 | November 22 | []() |  |  |
 | November 23 | []() |  |  |
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 14 | 7 | 7 |
+| Medium | 15 | 8 | 7 |
 | Hard   | 1 | 1 | 0 |

2024-11-November-LeetCoding-Challenge/Take K of Each Character From Left and Right.py

@@ -0,0 +1,31 @@
+class Solution:
+    def takeCharacters(self, s: str, k: int) -> int:
+        counts = [0, 0, 0]
+        for ch in s:
+            counts[ord(ch) - ord('a')] += 1
+        if min(counts) < k:
+            return -1
+
+        res = float('inf')
+        left = 0
+        for right in range(len(s)):
+            counts[ord(s[right]) - ord('a')] -= 1
+            while min(counts) < k:
+                counts[ord(s[left]) - ord('a')] += 1
+                left += 1
+            res = min(res, len(s)-(right-left+1))
+        return res
+
+
+def main():
+    s = 'aabaaaacaabc'
+    k = 2
+    assert Solution().takeCharacters(s, k) == 8
+
+    s = 'a'
+    k = 1
+    assert Solution().takeCharacters(s, k) == -1
+
+
+if __name__ == '__main__':
+    main()