Leetcode 2589. Minimum Time to Complete All Tasks
Pick the minimum set of integer time points to turn the computer on so that for each task i, at least duration_i chosen points lie within its interval [start_i, end_i]; because one chosen time can serve unlimited tasks, this is an interval-covering-with-multiplicities problem (solvable by greedy/scan techniques on discrete times).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.