Add solution #1482

JoshCrozier · JoshCrozier · commit 2fcf127d74b6 · 2025-04-15T23:19:24.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,323 LeetCode solutions in JavaScript
+# 1,324 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1133,6 +1133,7 @@
 1478|[Allocate Mailboxes](./solutions/1478-allocate-mailboxes.js)|Hard|
 1480|[Running Sum of 1d Array](./solutions/1480-running-sum-of-1d-array.js)|Easy|
 1481|[Least Number of Unique Integers after K Removals](./solutions/1481-least-number-of-unique-integers-after-k-removals.js)|Medium|
+1482|[Minimum Number of Days to Make m Bouquets](./solutions/1482-minimum-number-of-days-to-make-m-bouquets.js)|Medium|
 1486|[XOR Operation in an Array](./solutions/1486-xor-operation-in-an-array.js)|Easy|
 1491|[Average Salary Excluding the Minimum and Maximum Salary](./solutions/1491-average-salary-excluding-the-minimum-and-maximum-salary.js)|Easy|
 1492|[The kth Factor of n](./solutions/1492-the-kth-factor-of-n.js)|Medium|
diff --git a/solutions/1482-minimum-number-of-days-to-make-m-bouquets.js b/solutions/1482-minimum-number-of-days-to-make-m-bouquets.js
@@ -0,0 +1,59 @@
+/**
+ * 1482. Minimum Number of Days to Make m Bouquets
+ * https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/
+ * Difficulty: Medium
+ *
+ * You are given an integer array bloomDay, an integer m and an integer k.
+ *
+ * You want to make m bouquets. To make a bouquet, you need to use k adjacent flowers from the
+ * garden.
+ *
+ * The garden consists of n flowers, the ith flower will bloom in the bloomDay[i] and then can be
+ * used in exactly one bouquet.
+ *
+ * Return the minimum number of days you need to wait to be able to make m bouquets from the garden.
+ * If it is impossible to make m bouquets return -1.
+ */
+
+/**
+ * @param {number[]} bloomDay
+ * @param {number} m
+ * @param {number} k
+ * @return {number}
+ */
+var minDays = function(bloomDay, m, k) {
+  if (m * k > bloomDay.length) return -1;
+
+  let left = 1;
+  let right = Math.max(...bloomDay);
+  let result = -1;
+
+  while (left <= right) {
+    const mid = Math.floor((left + right) / 2);
+    if (canMakeBouquets(mid)) {
+      result = mid;
+      right = mid - 1;
+    } else {
+      left = mid + 1;
+    }
+  }
+
+  return result;
+
+  function canMakeBouquets(days) {
+    let bouquets = 0;
+    let flowers = 0;
+    for (const bloom of bloomDay) {
+      if (bloom <= days) {
+        flowers++;
+        if (flowers === k) {
+          bouquets++;
+          flowers = 0;
+        }
+      } else {
+        flowers = 0;
+      }
+    }
+    return bouquets >= m;
+  }
+};
