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.