Create Minimized Maximum of Products Distributed to Any Store.java

varunu28 · web-flow · commit f1e4d1887ee8 · 2024-11-14T06:35:00.000-08:00
diff --git a/Medium/Minimized Maximum of Products Distributed to Any Store.java b/Medium/Minimized Maximum of Products Distributed to Any Store.java
@@ -0,0 +1,36 @@
+class Solution {
+    public int minimizedMaximum(int n, int[] quantities) {
+        int left = 0;
+        int right = 0;
+        for (int quantity : quantities) {
+            right = Math.max(right, quantity);
+        }
+        while (left < right) {
+            int mid = (left + right) / 2;
+            if (isPossible(n, mid, quantities)) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+
+    private boolean isPossible(int n, int min, int[] quantities) {
+        int idx = 0;
+        int remaining = quantities[idx];
+        for (int i = 0; i < n; i++) {
+            if (remaining <= min) {
+                idx++;
+                if (idx == quantities.length) {
+                    return true;
+                } else {
+                    remaining = quantities[idx];
+                }
+            } else {
+                remaining -= min;
+            }
+        }
+        return false;
+    }
+}
