Python || Simple and Easy Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minimumDeletions(self, word: str, k: int) -> int:\n        c = Counter(word)\n        c = sorted(c.values())\n        mn = math.inf\n        p = 0\n        for i in range(len(c)):\n            temp = 0\n            for j in range(len(c) - 1, i, -1):\n                if c[j] <= (c[i] + k):break\n                temp += (c[j] - c[i] - k)\n            mn = min(mn, p + temp)\n            p += c[i]\n        return mn\n\n        \n```
['Hash Table', 'Greedy', 'Sorting', 'Python3']