Algorithm · Google · Medium
Problem: Smallest Car Fleet for Rental Intervals and Assignment Histories You receive N vehicle-rental intervals. Every interval includes: pickup_time return_time One vehicle may not be allocated to two rentals whose time ranges intersect. A rental ending exactly when another begins is compatible with the same vehicle: when return_time == next_pickup_time, the intervals are considered non-overlapping. A Car class is provided with: id rental_record, a list that holds the…
Checking your access…