Car Pooling

arraysortingheap (priority queue)

Problem Statement

There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).

You are given the integer capacity and an array trips where trips[i] = [numPassengers _i , from _i , to _i ] indicates that the i ^th trip has numPassengers _i passengers and the locations to pick them up and drop them off are from _i and to _i respectively. The locations are given as the number of kilometers due east from the car's initial location.

Return true if it is possible to pick up and drop off all passengers for all the given trips, or false otherwise .

Examples

Example 1

Input: trips = [[2,1,5],[3,3,7]], capacity = 4
Output: false

Example 2

Input: trips = [[2,1,5],[3,3,7]], capacity = 5
Output: true

Constraints

1 <= trips.length <= 1000

trips[i].length == 3

1 <= numPassengers _i <= 100

0 <= from _i < to _i <= 1000

1 <= capacity <= 10 ^5

🤔

Medium

Difficulty

Topic Info

ModuleDSA

CategoryArray

Sub-topicSorting