Add solution #3066

Author: JoshCrozier

README.md

@@ -588,6 +588,7 @@
 2727|[Is Object Empty](./2727-is-object-empty.js)|Easy|
 2948|[Make Lexicographically Smallest Array by Swapping Elements](./2948-make-lexicographically-smallest-array-by-swapping-elements.js)|Medium|
 3042|[Count Prefix and Suffix Pairs I](./3042-count-prefix-and-suffix-pairs-i.js)|Easy|
+3066|[Minimum Operations to Exceed Threshold Value II](./3066-minimum-operations-to-exceed-threshold-value-ii.js)|Medium|
 3105|[Longest Strictly Increasing or Strictly Decreasing Subarray](./3105-longest-strictly-increasing-or-strictly-decreasing-subarray.js)|Easy|
 3110|[Score of a String](./3110-score-of-a-string.js)|Easy|
 3151|[Special Array I](./3151-special-array-i.js)|Easy|

solutions/3066-minimum-operations-to-exceed-threshold-value-ii.js

@@ -0,0 +1,35 @@
+/**
+ * 3066. Minimum Operations to Exceed Threshold Value II
+ * https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed integer array nums, and an integer k.
+ *
+ * You are allowed to perform some operations on nums, where in a single operation, you can:
+ * - Select the two smallest integers x and y from nums.
+ * - Remove x and y from nums.
+ * - Insert (min(x, y) * 2 + max(x, y)) at any position in the array.
+ *
+ * Note that you can only apply the described operation if nums contains at least two elements.
+ *
+ * Return the minimum number of operations needed so that all elements of the array are greater
+ * than or equal to k.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var minOperations = function(nums, k) {
+  const queue = new MinPriorityQueue();
+  let operations = 0;
+
+  nums.forEach(n => queue.enqueue(n));
+  while (queue.size() >= 2 && queue.front().element < k) {
+    queue.enqueue(queue.dequeue().element * 2 + queue.dequeue().element);
+    operations++;
+  }
+
+  return operations;
+};