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

| 3396|[Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java)|| Easy|

| 3392|[Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java)|| Easy|

| 3375|[Minimum Operations to Make Array Values Equal to K](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java)|| Easy|

| 3370|[Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java)|| Easy|

| 3364|[Minimum Positive Sum Subarray](https://leetcode.com/problems/minimum-positive-sum-subarray/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3364.java)|| Easy|

| 3360|[Stone Removal Game](https://leetcode.com/problems/stone-removal-game/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3360.java)|| Easy|

packagecom.fishercoder.solutions.fourththousand;

importjava.util.TreeMap;

publicclass_3375 {

publicstaticclassSolution1 {

publicintminOperations(int[]nums,intk) {

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

for (intnum :nums) {

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

}

if (map.firstKey() <k) {

return -1;

}

if (map.firstKey() ==k) {

returnmap.size() -1;

}

returnmap.size();

}

}

}

packagecom.fishercoder.fourththousand;

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

importcom.fishercoder.solutions.fourththousand._3375;

importorg.junit.jupiter.api.BeforeEach;

importorg.junit.jupiter.api.Test;

publicclass_3375Test {

private_3375.Solution1solution1;

publicvoidsetup() {

solution1 =new_3375.Solution1();

}

publicvoidtest1() {

assertEquals(2,solution1.minOperations(newint[] {5,2,5,4,5},2));

}

publicvoidtest2() {

assertEquals(-1,solution1.minOperations(newint[] {2,1,2},2));

}

publicvoidtest3() {

assertEquals(4,solution1.minOperations(newint[] {9,7,5,3},1));

}

}