Least Number of Unique Integers after K Removals

Try to solve the Least Number of Unique Integers after K Removals problem.

We'll cover the following

Statement

You are given an integer array, arr, and an integer, k. Your task is to remove exactly k elements from the array so that the number of distinct integers remaining in the array is minimized. Determine the minimum possible count of unique integers after the removals.

Constraints:

  • 1≤1 \leq arr.length ≤103\leq 10^3

  • 1≤1 \leq arr[i] ≤105\leq 10^5

  • 0≤0 \leq k ≤\leq arr.length

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.