← Questions
Task scheduler with a cooldown between identical tasks
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a list of tasks (letters) and a cooldown n, identical tasks must be at least n time units apart; the CPU can idle. Return the fewest time units to run them all. Solve it with a counting formula or a max-heap simulation.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding