Solution: Task Scheduler
Understand how to schedule tasks with cooling intervals to minimize CPU time by analyzing task frequencies, sorting tasks, and calculating idle slots efficiently. This lesson guides you through implementing a strategy to ensure no identical tasks run too close, optimizing the timeline for task completion.
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:
...