| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1486|[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java)||Medium|Array, Bit Manipulation|

|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|

|1481|[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/_1481.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|

importjava.util.LinkedHashMap;

importjava.util.Map;

publicclass_5454 {

publicclass_1481 {

publicstaticclassSolution1 {

publicintfindLeastNumOfUniqueInts(int[]arr,intk) {

Map<Integer,Integer>unSortedMap =newHashMap<>();

packagecom.fishercoder;

importcom.fishercoder.solutions._5454;

importcom.fishercoder.solutions._1481;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_5454Test {

privatestatic_5454.Solution1solution1;

publicclass_1481Test {

privatestatic_1481.Solution1solution1;

privatestaticint[]arr;

publicstaticvoidsetup() {

solution1 =new_5454.Solution1();

solution1 =new_1481.Solution1();

}