Task Scheduler — Medium Coding Interview Question

Given CPU tasks (character array) and a cooldown n, each same task must wait n intervals before rerunning. Return the minimum number of intervals to finish all tasks.

Example

Input: tasks = ["A","A","A","B","B","B"], n = 2

Output: 8

Explanation: A→B→idle→A→B→idle→A→B

Constraints

• 1 ≤ tasks.length ≤ 10⁴
• n is between 0 and 100

Topics & Companies

Topics: greedy, heap, arrays

Asked by: Amazon, Google, Meta, Microsoft, Bloomberg

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns