Add solution #2233

Author: JoshCrozier

README.md

@@ -2026,6 +2026,7 @@
 2229|[Check if an Array Is Consecutive](./solutions/2229-check-if-an-array-is-consecutive.js)|Easy|
 2231|[Largest Number After Digit Swaps by Parity](./solutions/2231-largest-number-after-digit-swaps-by-parity.js)|Easy|
 2232|[Minimize Result by Adding Parentheses to Expression](./solutions/2232-minimize-result-by-adding-parentheses-to-expression.js)|Medium|
+2233|[Maximum Product After K Increments](./solutions/2233-maximum-product-after-k-increments.js)|Medium|
 2234|[Maximum Total Beauty of the Gardens](./solutions/2234-maximum-total-beauty-of-the-gardens.js)|Hard|
 2235|[Add Two Integers](./solutions/2235-add-two-integers.js)|Easy|
 2236|[Root Equals Sum of Children](./solutions/2236-root-equals-sum-of-children.js)|Easy|

solutions/2233-maximum-product-after-k-increments.js

@@ -0,0 +1,38 @@
+/**
+ * 2233. Maximum Product After K Increments
+ * https://leetcode.com/problems/maximum-product-after-k-increments/
+ * Difficulty: Medium
+ *
+ * You are given an array of non-negative integers nums and an integer k. In one operation,
+ * you may choose any element from nums and increment it by 1.
+ *
+ * Return the maximum product of nums after at most k operations. Since the answer may be
+ * very large, return it modulo 109 + 7. Note that you should maximize the product before
+ * taking the modulo.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var maximumProduct = function(nums, k) {
+  const MOD = 1e9 + 7;
+  const minHeap = new PriorityQueue((a, b) => a - b);
+
+  for (const num of nums) {
+    minHeap.enqueue(num);
+  }
+
+  for (let i = 0; i < k; i++) {
+    const smallest = minHeap.dequeue();
+    minHeap.enqueue(smallest + 1);
+  }
+
+  let result = 1;
+  while (!minHeap.isEmpty()) {
+    result = (result * minHeap.dequeue()) % MOD;
+  }
+
+  return result;
+};