Task Scheduler
Medium
Greedy
Given a list of tasks (letters) and a cooldown n, the CPU needs at least n units of time between two executions of the same task. Each unit can run one task or stay idle. Print the minimum number of time units needed to finish all tasks.
Constraints
1 <= t <= 10^4 0 <= n <= 100 Uppercase letters
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.