15% off all plans & roadmaps Use code
See plans
Preparing this workspace.
LeetCode 1482 · Solution & editorial
You are given an integer array bloomDay, an integer m and an integer k.
Minimum Number of Days to Make m Bouquets is a Binary Search Patterns problem, in the On Answer / Condition Function subpattern. The pattern covers standard binary search, rotated arrays, first/last occurrence, and search on answer space
Learn binary search on answer space for optimization problems like Koko eating bananas and capacity to ship packages.
The reference solution runs in O(nlogd) time and O(1) space.
Minimum Number of Days to Make m Bouquets has been reported in interviews at Google.
The full editorial is part of Pro
It explains the core insight, the complexity analysis and the common mistakes, with a worked solution.
Minimum Number of Days to Make m Bouquets is a Binary Search Patterns problem, in the On Answer / Condition Function subpattern. Once the approach above makes sense, write it yourself and then work through the neighbouring problems that reuse it.