fishercoder1534
diff --git a/‎paginated_contents/algorithms/4th_thousand/README.md
Copy file name to clipboardExpand all lines: paginated_contents/algorithms/4th_thousand/README.md
+1Lines changed: 1 addition & 0 deletions b/‎paginated_contents/algorithms/4th_thousand/README.md
Copy file name to clipboardExpand all lines: paginated_contents/algorithms/4th_thousand/README.md
+1Lines changed: 1 addition & 0 deletions
diff --git a/‎src/main/java/com/fishercoder/solutions/fourththousand/_3375.java
Copy file name to clipboard
+21Lines changed: 21 additions & 0 deletions b/‎src/main/java/com/fishercoder/solutions/fourththousand/_3375.java
Copy file name to clipboard
+21Lines changed: 21 additions & 0 deletions
diff --git a/‎src/test/java/com/fishercoder/fourththousand/_3375Test.java
Copy file name to clipboard
+31Lines changed: 31 additions & 0 deletions b/‎src/test/java/com/fishercoder/fourththousand/_3375Test.java
Copy file name to clipboard
+31Lines changed: 31 additions & 0 deletions
@@ -2,6 +2,7 @@
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
 | 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       |
 
@@ -0,0 +1,21 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.TreeMap;
+
+public class _3375 {
+    public static class Solution1 {
+        public int minOperations(int[] nums, int k) {
+            TreeMap<Integer, Integer> map = new TreeMap<>();
+            for (int num : nums) {
+                map.put(num, map.getOrDefault(num, 0) + 1);
+            }
+            if (map.firstKey() < k) {
+                return -1;
+            }
+            if (map.firstKey() == k) {
+                return map.size() - 1;
+            }
+            return map.size();
+        }
+    }
+}
@@ -0,0 +1,31 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fourththousand._3375;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3375Test {
+    private _3375.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3375.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.minOperations(new int[] {5, 2, 5, 4, 5}, 2));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(-1, solution1.minOperations(new int[] {2, 1, 2}, 2));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(4, solution1.minOperations(new int[] {9, 7, 5, 3}, 1));
+    }
+}