Solution: Task Scheduler
Explore how to determine the minimum CPU intervals needed to complete all tasks with cooling periods by applying task frequency analysis and strategic scheduling. Understand how to track task occurrences, sort frequencies, calculate idle slots, and optimize intervals to solve the Task Scheduler problem effectively 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:
...