Search⌘ K
AI Features

Solution: Task Scheduler

Understand how to minimize CPU intervals in task scheduling with cooling periods by prioritizing the most frequent tasks and filling idle slots. Explore a frequency count and sorting method that efficiently schedules tasks while adhering to the required cooling time between identical CPU activities.

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:

  • 1 1 \leq ...