g1401_1500.s1481_least_number_of_unique_integers_after_k_removals

Class Solution

java.lang.Object

g1401_1500.s1481_least_number_of_unique_integers_after_k_removals.Solution

public class Solution
extends Object

1481 - Least Number of Unique Integers after K Removals.

Medium

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^5
• 1 <= arr[i] <= 10^9
• 0 <= k <= arr.length

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int	findLeastNumOfUniqueInts(int[] arr, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

findLeastNumOfUniqueInts

public int findLeastNumOfUniqueInts(int[] arr,
                                    int k)