Minimum Riders for Delivery Intervals
Problem statement
Each delivery occupies one rider from its start time until its end time. Return the fewest riders needed to handle every delivery.
For this exercise, deliveries[i] = [start, end] is a fixed interval. A rider handles at most one delivery at a time. A delivery ending at time t releases its rider before another delivery starting at t. Deliveries may be given in any order. An empty list needs zero riders.
Function
minimumRiders(deliveries: int[][]) → intExamples
Example 1
deliveries = [[1,4],[2,5],[4,6]]return = 2At time 2, the first two deliveries overlap. At time 4, the first rider becomes free for the third delivery, so two riders are enough.
Example 2
deliveries = [[0,10],[2,7],[3,4]]return = 3All three deliveries are active at time 3, so three riders are necessary and sufficient.
Example 3
deliveries = []return = 0There are no deliveries to cover.
Constraints
- 0 <= deliveries.length <= 100000
- Each delivery has exactly 2 integers.
- 0 <= deliveries[i][j] <= 10^9
- Every delivery satisfies start < end.