Add solution #3375

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,224 LeetCode solutions in JavaScript
+# 1,225 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1220,6 +1220,7 @@
 3223|[Minimum Length of String After Operations](./solutions/3223-minimum-length-of-string-after-operations.js)|Medium|
 3306|[Count of Substrings Containing Every Vowel and K Consonants II](./solutions/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.js)|Medium|
 3356|[Zero Array Transformation II](./solutions/3356-zero-array-transformation-ii.js)|Medium|
+3375|[Minimum Operations to Make Array Values Equal to K](./solutions/3375-minimum-operations-to-make-array-values-equal-to-k.js)|Easy|
 3392|[Count Subarrays of Length Three With a Condition](./solutions/3392-count-subarrays-of-length-three-with-a-condition.js)|Easy|
 3394|[Check if Grid can be Cut into Sections](./solutions/3394-check-if-grid-can-be-cut-into-sections.js)|Medium|
 3396|[Minimum Number of Operations to Make Elements in Array Distinct](./solutions/3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js)|Easy|

solutions/3375-minimum-operations-to-make-array-values-equal-to-k.js

@@ -0,0 +1,44 @@
+/**
+ * 3375. Minimum Operations to Make Array Values Equal to K
+ * https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/
+ * Difficulty: Easy
+ *
+ * You are given an integer array nums and an integer k.
+ *
+ * An integer h is called valid if all values in the array that are strictly greater than
+ * h are identical.
+ *
+ * For example, if nums = [10, 8, 10, 8], a valid integer is h = 9 because all nums[i] > 9
+ * are equal to 10, but 5 is not a valid integer.
+ *
+ * You are allowed to perform the following operation on nums:
+ * - Select an integer h that is valid for the current values in nums.
+ * - For each index i where nums[i] > h, set nums[i] to h.
+ *
+ * Return the minimum number of operations required to make every element in nums equal to k.
+ * If it is impossible to make all elements equal to k, return -1.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var minOperations = function(nums, k) {
+  if (nums.some(x => x < k)) return -1;
+
+  const uniqueAbove = [...new Set(nums.filter(x => x > k))].sort((a, b) => b - a);
+  if (uniqueAbove.length === 0) return 0;
+
+  let result = 0;
+  let current = uniqueAbove.slice();
+
+  while (current.length > 0) {
+    const threshold = current[0] - 1;
+    current = current.filter(x => x <= threshold);
+    result++;
+    if (current.every(x => x === k)) break;
+  }
+
+  return result;
+};