Available question text
Given an ordered list of task types and a cooldown "space", find the minimum total days (including required breaks) to finish all tasks while ensuring any two tasks of the same type are separated by at least space days. Core idea: simulate tasks sequentially and greedily track the last completion day per type, inserting waits when the cooldown requirement isn't yet met.
Related questions
Continue with questions that share topics or the same question type.
- Task Scheduler
Coding · Array · Counting · Greedy
- Design Task Manager
Coding
- Earliest Time to Finish One Task
Coding
- Employee Task Duration and Concurrent Tasks
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
Amazon
Leetcode 2365. Task Scheduler II
Reported Sep 14, 2026 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source