Schedule Tasks on Minimum 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:

1. A machine can execute only one task at a time.

2. A machine can begin executing a new task immediately after completing the previous one.

3. 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$ tasksi.start $<$ tasksi.end $\leq 10^4$

Examples