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

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

|2148|[Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2148.java)||Easy||

|2144|[Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2144.java)||Easy||

|2139|[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2139.java)||Medium||

|2138|[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2138.java)||Easy||

packagecom.fishercoder.solutions;

importjava.util.TreeMap;

publicclass_2148 {

publicstaticclassSolution1 {

publicintcountElements(int[]nums) {

TreeMap<Integer,Integer>treeMap =newTreeMap<>();

for (intnum :nums) {

treeMap.put(num,treeMap.getOrDefault(num,0) +1);

}

intans =0;

inti =0;

intlen =treeMap.size();

for (intkey :treeMap.keySet()) {

if (i !=0 &&i !=len -1) {

ans +=treeMap.get(key);

}

i++;

}

returnans;

}

}

}

}