Problem: Schedule Tasks on Minimum Machines

Medium

30 min

Explore how to schedule multiple tasks on the minimum number of machines given their start and end times. Learn to apply heaps to manage overlapping intervals, ensuring tasks run without conflict. This lesson equips you to solve dynamic scheduling problems by efficiently allocating resources in scenarios with unlimited machines.

Statement

We are given an input array, tasks, where tasks[i] $= [start_i, end_i]$ represents the start and end times of $n$ tasks. Our goal is to schedule these tasks on machines given the following criteria:

A machine can execute only one task at a time.
A machine can begin executing a new task immediately after completing the previous one.
An unlimited number of machines are available.

Find the minimum number of machines required to complete these $n$ tasks.

Constraints:

$n ==$ tasks.length
$1 \leq$ tasks.length $\leq 10^3$
$0 \leq$ tasks_i.start $<$ tasks_i.end $\leq 10^4$

Problem: Schedule Tasks on Minimum Machines

Medium

30 min

Statement

A machine can execute only one task at a time.
A machine can begin executing a new task immediately after completing the previous one.
An unlimited number of machines are available.

Find the minimum number of machines required to complete these $n$ tasks.

Constraints:

$n ==$ tasks.length
$1 \leq$ tasks.length $\leq 10^3$
$0 \leq$ tasks_i.start $<$ tasks_i.end $\leq 10^4$

Problem: Schedule Tasks on Minimum Machines

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Schedule Tasks on Minimum Machines

Statement

Examples

Understand the problem

Figure it out!

Try it yourself