LC-1481 Medium LeetCode

1481. Least Number of Unique Integers after K Removals

Array Hash Table Greedy Sorting Counting

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 63% Topics: Array, Hash Table, Greedy, Sorting, Counting

Reading material

Arrays & Hashing 12 min Greedy 11 min Sorting 13 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(n)

import collections


class Solution(object):
    def findLeastNumOfUniqueInts(self, arr, k):
        """
        :type arr: List[int]
        :type k: int
        :rtype: int
        """
        count = collections.Counter(arr)
        result, count_count = len(count), collections.Counter(count.itervalues())
        for c in xrange(1, len(arr)+1): 
            if k < c*count_count[c]:
                result -= k//c
                break
            k -= c*count_count[c]
            result -= count_count[c]                
        return result

Solution from kamyu104/LeetCode-Solutions · MIT