Available question text
Given single-worker planting times and post-plant growth times, schedule the planting order to minimize the day when all flowers have finished growing; this is a scheduling/makespan problem where a greedy order by descending growTime yields the optimal solution.
Related questions
Continue with questions that share topics or the same question type.
- All Possible Full Binary Trees
Coding
- Number of Flowers in Full Bloom
Coding · Array · Binary Search · Hash Table
- Advent of Code Day 7 Variation
Coding
- Amount of New Area Painted Each Day
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2136. Earliest Possible Day of Full Bloom
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source