Solution: Task Scheduler
Explore how to solve the Task Scheduler problem by efficiently tracking task frequencies and scheduling to minimize CPU intervals. Understand the approach to separate identical tasks with cooling periods, optimize idle slots, and calculate the minimum time needed to complete all tasks.
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:
...