car-pooling

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

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

You are given the integer <code>capacity</code> and an array <code>trips</code> where <code>trips[i] = [numPassengersi, fromi, toi]</code> indicates that the <code>ith</code> trip has <code>numPassengersi</code> passengers and the locations to pick them up and drop them off are <code>fromi</code> and <code>toi</code> respectively. The locations are given as the number of kilometers due east from the car&#39;s initial location.

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

&nbsp;
Example 1:

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

Example 2:

<pre>
Input: trips = [[2,1,5],[3,3,7]], capacity = 5
Output: true
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= trips.length &lt;= 1000</code></li>
	<li><code>trips[i].length == 3</code></li>
	<li><code>1 &lt;= numPassengersi &lt;= 100</code></li>
	<li><code>0 &lt;= fromi &lt; toi &lt;= 1000</code></li>
	<li><code>1 &lt;= capacity &lt;= 105</code></li>
</ul>