Solution: Task Scheduler
Explore how to solve the CPU task scheduling problem by tracking task frequencies and applying the cooling period constraint. Learn to compute the minimum number of CPU intervals required by scheduling tasks based on their occurrence and filling idle slots effectively. Understand the algorithm, complexity, and implementation details to handle this pattern efficiently in C#.
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:
...