Minimum Number of Days to Make m Bouquets

medium

Pick m bouquets of k adjacent blooms, minimizing flowering day

Minimum Number of Days to Make m Bouquets

Key Insight

Monotonic predicate: if day d is feasible, any later day is feasible.

Step 1Binary Search Days
m=3, k=1
L
1
0
10
1
3
2
10
3
2
4
Search space: [1..10]

Search days in the min..max bloom range.

1 / 3

Learn the Pattern

Binary SearchEliminate half the search space each iteration by comparing the midpoint against a condition, reducing O(n) linear scans to O(log n).
Practice the Code

Step-by-Step Walkthrough: Minimum Number of Days to Make m Bouquets

Monotonic predicate: if day d is feasible, any later day is feasible.

  1. Binary Search Days

    Search days in the min..max bloom range.

  2. Day 5 Feasible

    All bloom days <=5 form 3 bouquets of size 1, so 5 is feasible.

  3. Result

    Converge to smallest feasible day.