CodingMediumcod-g571

Subject Binary searchLevel Mid–Senior~24 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You have a garden where bloom[i] is the day the i-th flower blooms. To make a bouquet you need k adjacent (consecutive in the array) bloomed flowers; you want to make m bouquets. Return the minimum number of days to wait so you can make m bouquets, or -1 if it is impossible. 1 <= len(bloom) <= 1e5.

Implement

min_days_bouquets(bloom: list[int], m: int, k: int) → int

Examples

in[[1,10,3,10,2],3,1]out3

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.