# Minimum Number Of Days To Make M Bouquets: Interview Notes
Minimum Number Of Days To Make M Bouquets shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary-search the day D. Flowers with bloom[i] <= D become available; walk them and count adjacent groups of size k. Feasible when you can form at least m such groups.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log D).
## Common mistake
Picking any m*k flowers instead of adjacent groups of exactly k, which ignores the bouquet adjacency rule.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI interview assistant.