Min Days to Bloom

Problem Overview

• Determine the earliest day to make n bouquets, each using k adjacent roses that have bloomed.
• Input: array roses where roses[i] is the day rose i blooms, plus integers k and n; Output: the earliest feasible day.
• Context: planning and scheduling for flower bouquet assembly based on bloom timelines.
• From Google interviews; a coding interview problem and common interview question.