Solution: Task Scheduler
Explore how to solve the CPU task scheduling problem by analyzing task frequencies and applying a cooling period between identical tasks. Learn to calculate the minimum number of CPU intervals needed by strategically spacing tasks and filling idle intervals, understanding both the approach and its time and space complexities.
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:
...