#1481

Least Number of Unique Integers after K Removals

specialist · 660 · lc medium +30 · verified · 63.8% accepted · 2,338 likes · top 66%

Description

You are given an integer array arr and a non-negative integer k. Remove exactly k elements from arr to minimize the number of distinct values that remain. Return that minimum count of unique integers.

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.

Code

1

2

class Solution:
    def findLeastNumOfUniqueInts(self, arr: List[int], k: int) -> int:

class Solution:
    def findLeastNumOfUniqueInts(self, arr: List[int], k: int) -> int: