1481. Least Number of Unique Integers after K Removals
Medium63.7% acceptance280,081 / 439,378 submissions
Asked by 7 companies
Topics
Given an array of integers arr and an integer k. Find the least number of unique integers after removing exactly k elements.
Example 1:
Input: arr = [5,5,4], k = 1 Output: 1 Explanation: Remove the single 4, only 5 is left.Example 2:
Input: arr = [4,3,1,1,3,3,2], k = 3 Output: 2 Explanation: Remove 4, 2 and either one of the two 1s or three 3s. 1 and 3 will be left.
Constraints:
1 <= arr.length <= 10^51 <= arr[i] <= 10^90 <= k <= arr.length
Hints
Hint 1
Use a map to count the frequencies of the numbers in the array.
Hint 2
An optimal strategy is to remove the numbers with the smallest count first.