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] $= [\text{numPassengers}_i, \text{from}_i, \text{to}_i]$ represents a group of $\text{numPassengers}_i$ that must be picked up at location $\text{from}_i$ and dropped off at location $\text{to}_i$. All locations are measured in kilometers east of the starting point.

Your task is to determine whether it is possible to complete all the trips without exceeding the car’s capacity at any point in time.

Return TRUE if all trips can be completed successfully, or FALSE otherwise.

Constraints:

• $1 \leq$ trips.length $\leq 1000$

• trips[i].length $== 3$

• $1 \leq \text{numPassengers}_i \leq 100$

• $0 \leq \text{from}_i < \text{to}_i \leq 1000$

• $1 \leq$ capacity $\leq 10^5$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding on how to solve this problem.

Implement your solution in the following coding playground.