Add leetcode problem 3085

Author: lht102

leetcode/src/03085_minimum_deletions_to_make_string_k_special/__init__.py

@@ -0,0 +1,16 @@
+from bisect import bisect_right
+from collections import Counter
+from itertools import accumulate, repeat
+
+
+class Solution:
+    def minimumDeletions(self, word: str, k: int) -> int:
+        c = Counter(word)
+        nums = sorted(list(c.values()))
+        psum = list(accumulate(nums, initial=0))
+        res = psum[-1]
+        for i, num in enumerate(nums):
+            x = num + k
+            j = bisect_right(nums, x, lo=i)
+            res = min(res, psum[-1] - psum[j] - (len(nums) - j) * x + psum[i])
+        return res

leetcode/src/03085_minimum_deletions_to_make_string_k_special/solution.py

@@ -0,0 +1,16 @@
+import unittest
+from .solution import Solution
+
+
+class TestSolution(unittest.TestCase):
+    def test_minimumDeletions(self):
+        s = Solution()
+        self.assertEqual(s.minimumDeletions("aabcaba", 0), 3)
+        self.assertEqual(s.minimumDeletions("dabdcbdcdcd", 2), 2)
+        self.assertEqual(s.minimumDeletions("aaabaaa", 2), 1)
+        self.assertEqual(s.minimumDeletions("ahahnhahhah", 1), 2)
+        self.assertEqual(s.minimumDeletions("dabdcbdcdcd", 2), 2)
+
+
+if __name__ == "__main__":
+    unittest.main()