Days to Make Bouquets
Intermediate
bloom[i] is the day on which flower i blooms. A bouquet uses k neighbouring flowers (positions next to each other) that have all bloomed, and each flower can be used in only one bouquet. Return the earliest day by which you can make m bouquets, or -1 if it is impossible.
Examples
Example 1
Input:
min_days_bouquets([1, 10, 3, 10, 2], 3, 1)
Output:
3
On day 3 flowers 0, 2 and 4 have bloomed: 3 bouquets of 1.
Example 2
Input:
min_days_bouquets([7, 7, 7, 7, 12, 7, 7], 2, 3)
Output:
12
On day 12 everything has bloomed: [7,7,7] and [7,7,7] around the 12.
Constraints
1 <= len(bloom) <= 2 * 10**41 <= bloom[i] <= 10**91 <= m, k <= 2 * 10**4- Trying every day one by one is too slow for the large tests.
Theory
Go to TheoryKeywords
dsa-sheetbinary-searchbinary-search-on-the-answer
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.