Solution: Car Pooling

Let’s solve the Car Pooling using the Merge Intervals pattern.

Statement

You are given a car with a fixed number of seats, denoted by an integer capacity. The car only travels in one direction — eastward — and does not make any U-turns.

You are also provided with an array, trips, where each element trips[i] =[numPassengersi,fromi,toi]= [\text{numPassengers}_i, \text{from}_i, \text{to}_i] represents a group of numPassengersi\text{numPassengers}_i that must be picked up at location fromi\text{from}_i and dropped off at location toi\text{to}_i ...