The task that occurs the most dictates the shape of the schedule: it creates a frame with (maxFreq - 1) gaps of width (n + 1).

Task Scheduler

medium

Acceptance: 44%

HeapGreedyArray

A CPU must execute a set of tasks represented by characters. Between two executions of the same task there must be at least n intervals of cooldown (other tasks or idle slots). Determine the minimum total number of intervals the CPU needs to complete every task.

Examples

Example 1:

Input:tasks = ['X','X','X','Y','Y','Y'], n = 2

Output:8

Example 2:

Input:tasks = ['X','X','X','Y','Y','Y'], n = 0

Output:6

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Task Scheduler

Examples

Hints

Related Problems