Jun 21

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Minimum Deletions to Make String K-Special.py

@@ -0,0 +1,36 @@
+from collections import Counter
+
+
+class Solution:
+    def minimumDeletions(self, word: str, k: int) -> int:
+        freqs = list(Counter(word).values())
+        freqs.sort()
+
+        min_deletions = len(word)
+        prefix_sum = 0
+        for i in range(len(freqs)):
+            deletions = prefix_sum
+            for j in range(i + 1, len(freqs)):
+                if freqs[j] > freqs[i] + k:
+                    deletions += freqs[j] - (freqs[i] + k)
+            min_deletions = min(min_deletions, deletions)
+            prefix_sum += freqs[i]
+        return min_deletions
+
+
+def main():
+    word = 'aabcaba'
+    k = 0
+    assert Solution().minimumDeletions(word, k) == 3
+
+    word = 'dabdcbdcdcd'
+    k = 2
+    assert Solution().minimumDeletions(word, k) == 2
+
+    word = 'aaabaaa'
+    k = 2
+    assert Solution().minimumDeletions(word, k) == 1
+
+
+if __name__ == '__main__':
+    main()

2025-06-June-LeetCoding-Challenge/README.md

@@ -24,7 +24,7 @@
 | June 18 | [2966. Divide Array Into Arrays With Max Difference](https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/) | Medium | Solved |
 | June 19 | [2294. Partition Array Such That Maximum Difference Is K](https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/) | Medium | Solved |
 | June 20 | []() |  |  |
-| June 21 | []() |  |  |
+| June 21 | [3085. Minimum Deletions to Make String K-Special](https://leetcode.com/problems/minimum-deletions-to-make-string-k-special/) | Medium | Solved |
 | June 22 | []() |  |  |
 | June 23 | []() |  |  |
 | June 24 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 3 | 3 | 0 |
-| Medium | 9 | 6 | 3 |
+| Medium | 10 | 7 | 3 |
 | Hard   | 5 | 2 | 3 |