Task Scheduler
Learn this problem
AmazonFULLTIMEOAProblem statement
AMZ Interval Collection (A group of problems focused on operations involving intervals :) -
2. Merge Intervals (Intern, NG)
3. Find Overlapping Times (Intern)
4. Get Maximum Sum Find Overlapping Times (Full-Time)
5. Optimal Interval Difference
You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task. Tasks can be completed in any order, but there's a constraint: there has to be a gap of at least n intervals between two tasks with the same label.
Return the minimum number of CPU intervals required to complete all tasks.
Function
leastInterval(tasks: char[], n: int) → int
Complete the function leastInterval in the editor.
leastInterval has the following parameters:
- 1.
char[] tasks: an array of uppercase English letters representing tasks - 2.
int n: the cooling interval
Returns
int: the minimum number of intervals to complete all tasks
( ˶ˆᗜˆ˵ ) Many Manyy Manyyy thanks to spike!ᯓᡣ𐭩
Examples
Example 1
tasks = ["A","A","A","B","B","B"]n = 2return = 8A possible sequence is: A -> B -> idle -> A -> B -> idle -> A -> B.
After completing task A, you must wait two intervals before doing A again. The same applies to task B. In the 3rd interval, neither A nor B can be done, so you idle. By the 4th interval, you can do A again as 2 intervals have passed.
Example 2
tasks = ["A","C","A","B","D","B"]n = 1return = 6A possible sequence is: A -> B -> C -> D -> A -> B.
With a cooling interval of 1, you can repeat a task after just one other task.
Example 3
tasks = ["A","A","A","B","B","B"]n = 3return = 10A possible sequence is: A -> B -> idle -> idle -> A -> B -> idle -> idle -> A -> B.
There are only two types of tasks, A and B, which need to be separated by 3 intervals. This leads to idling twice between repetitions of these tasks.
Constraints
1 <= tasks.length <= 10^4tasks[i]is an uppercase English letter.0 <= n <= 100