Time: 100 ms (92.51%) | Memory: 69.3 MB (13.37%) - LeetSync

Author: sayandip20

1605-minimum-number-of-days-to-make-m-bouquets/minimum-number-of-days-to-make-m-bouquets.cpp

@@ -0,0 +1,34 @@
+class Solution {
+public:
+
+    bool possible(vector<int>& bloomDay, int day, int m, int k){
+        int cnt = 0;
+        int noOfB = 0;
+        for(int i = 0; i < bloomDay.size(); i++){
+            if(bloomDay[i] <= day) cnt += 1;
+            else{
+                noOfB += (cnt / k);
+                cnt = 0;
+            }
+        }
+        noOfB += (cnt / k);
+        return noOfB >= m;
+    }
+
+    int minDays(vector<int>& bloomDay, int m, int k) {
+        long long val = m * 1LL * k *1LL;
+        if(val > bloomDay.size()) return -1;
+        int mini = INT_MAX, maxi = INT_MIN;
+        for(int i = 0; i < bloomDay.size(); i++){
+            mini = min(mini, bloomDay[i]);
+            maxi = max(maxi, bloomDay[i]);
+        }
+        int low = mini, high = maxi;
+        while(low <= high){
+            int mid = low + (high - low) / 2;
+            if(possible(bloomDay, mid, m, k)) high = mid - 1;
+            else low = mid + 1;
+        }
+        return low;
+    }
+};