add 5454

fishercoder1534 · fishercoder1534 · commit 814ecc6cecaf · 2020-06-14T14:49:15.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|5454|[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5454.java) | |Medium|Array, Sort|
 |5453|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5453.java) | |Easy|Array|
 |1476|[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Medium|Array|
 |1475|[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) | |Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_5454.java b/src/main/java/com/fishercoder/solutions/_5454.java
@@ -0,0 +1,33 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.LinkedHashMap;
+import java.util.Map;
+
+public class _5454 {
+    public static class Solution1 {
+        public int findLeastNumOfUniqueInts(int[] arr, int k) {
+            Map<Integer, Integer> unSortedMap = new HashMap<>();
+            for (int num : arr) {
+                unSortedMap.put(num, unSortedMap.getOrDefault(num, 0) + 1);
+            }
+            //LinkedHashMap preserve the ordering of elements in which they are inserted
+            LinkedHashMap<Integer, Integer> sortedMap = new LinkedHashMap<>();
+
+            unSortedMap.entrySet()
+                    .stream()
+                    .sorted(Map.Entry.comparingByValue())
+                    .forEachOrdered(x -> sortedMap.put(x.getKey(), x.getValue()));
+            int leastUniq = 0;
+            for (int key : sortedMap.keySet()) {
+                int count = sortedMap.get(key);
+                if (k >= count) {
+                    k -= count;
+                } else {
+                    leastUniq++;
+                }
+            }
+            return leastUniq;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_5454Test.java b/src/test/java/com/fishercoder/_5454Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._5454;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _5454Test {
+    private static _5454.Solution1 solution1;
+    private static int[] arr;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _5454.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        arr = new int[]{5, 5, 4};
+        assertEquals(1, solution1.findLeastNumOfUniqueInts(arr, 1));
+    }
+
+}
