Leetcode 2136. Earliest Possible Day of Full Bloom
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.