Solution: Task Scheduler
Understand how to solve the Task Scheduler problem by analyzing task frequencies and scheduling with cooling periods. Learn to minimize CPU intervals by spacing the most frequent tasks, filling idle slots with others, and applying an efficient algorithm with O(n) complexity.
We'll cover the following...
Statement
You are given an array of CPU tasks represented by uppercase letters (A to Z) and an integer n, which denotes the cooling period required between any two identical tasks. Each task takes exactly one CPU interval to execute. Therefore, each CPU interval can either perform a task or remain idle. Tasks can be executed in any order, but the same task must be separated by at least n intervals.
Determine the minimum number of CPU intervals required to complete all tasks.
Constraints:
...