Schedule Tasks on Minimum Machines

Statement

We are given an input array, tasks, which contains the start and end times of $n$ tasks. Your task is to find the minimum number of machines required to complete these $n$ tasks.

Constraints:

• $n ==$ tasks.length
• $1 <=$ tasks.length $<= 10^{3}$
• $0$ $\leq$ $tasks_{i}.start$ $\lt$ $tasks_{i}.end$ $\leq$ $10^{6}$

Examples