Driver Delivery Cost Problem | Dataford Interview Questions

Driver Delivery question.

Implement min_drivers(deliveries). Each delivery is represented as [start, end], where the driver is occupied during the half-open interval [start, end). Return the minimum number of drivers needed to handle all deliveries. A driver becomes available when one delivery ends, so deliveries sharing only an endpoint do not overlap.

Input is a list of integer interval pairs. Return an integer. Assume every interval has start < end.

Constraints

0 <= deliveries.length <= 1000
Each delivery has exactly two integers, [start, end]
start < end for every delivery
-10^9 <= start < end <= 10^9
Intervals use half-open semantics: [start, end)

Function Signature

def min_drivers(deliveries):

Your question is Driver Delivery Cost Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Driver Delivery question.

Input is a list of integer interval pairs. Return an integer. Assume every interval has start < end.

Constraints

0 <= deliveries.length <= 1000
Each delivery has exactly two integers, [start, end]
start < end for every delivery
-10^9 <= start < end <= 10^9
Intervals use half-open semantics: [start, end)

Function Signature

def min_drivers(deliveries):

Your question is Driver Delivery Cost Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.