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 \leq$ tasks.length $\leq 1000$
...

Two Pointers

Fast and Slow Pointers

Sliding Window

Heaps

Modified Binary Search

Dynamic Programming

Topological Sort

Graphs

Tree Breadth First Search

Union Find

Coding Patterns

Solution: Task Scheduler

Statement