_1481.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.LinkedHashMap;
importjava.util.Map;

publicclass_1481 {
publicstaticclassSolution1 {
publicintfindLeastNumOfUniqueInts(int[] arr, intk) {
Map<Integer, Integer> unSortedMap = newHashMap<>();
for (intnum : arr) {
unSortedMap.put(num, unSortedMap.getOrDefault(num, 0) + 1);
 }
// LinkedHashMap preserve the ordering of elements in which they are inserted
LinkedHashMap<Integer, Integer> sortedMap = newLinkedHashMap<>();

unSortedMap.entrySet().stream()
 .sorted(Map.Entry.comparingByValue())
 .forEachOrdered(x -> sortedMap.put(x.getKey(), x.getValue()));
intleastUniq = 0;
for (intkey : sortedMap.keySet()) {
intcount = sortedMap.get(key);
if (k >= count) {
k -= count;
 } else {
leastUniq++;
 }
 }
returnleastUniq;
 }
 }
}