Add solution #1094

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,132 LeetCode solutions in JavaScript
+# 1,133 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -874,6 +874,7 @@
 1091|[Shortest Path in Binary Matrix](./solutions/1091-shortest-path-in-binary-matrix.js)|Medium|
 1092|[Shortest Common Supersequence](./solutions/1092-shortest-common-supersequence.js)|Hard|
 1093|[Statistics from a Large Sample](./solutions/1093-statistics-from-a-large-sample.js)|Medium|
+1094|[Car Pooling](./solutions/1094-car-pooling.js)|Medium|
 1103|[Distribute Candies to People](./solutions/1103-distribute-candies-to-people.js)|Easy|
 1108|[Defanging an IP Address](./solutions/1108-defanging-an-ip-address.js)|Easy|
 1122|[Relative Sort Array](./solutions/1122-relative-sort-array.js)|Easy|

solutions/1094-car-pooling.js

@@ -0,0 +1,38 @@
+/**
+ * 1094. Car Pooling
+ * https://leetcode.com/problems/car-pooling/
+ * Difficulty: Medium
+ *
+ * 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] = [numPassengersi, fromi, toi] indicates that the ith trip has numPassengersi
+ * passengers and the locations to pick them up and drop them off are fromi and toi 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.
+ */
+
+/**
+ * @param {number[][]} trips
+ * @param {number} capacity
+ * @return {boolean}
+ */
+var carPooling = function(trips, capacity) {
+  const timeline = new Array(1001).fill(0);
+
+  for (const [passengers, start, end] of trips) {
+    timeline[start] += passengers;
+    timeline[end] -= passengers;
+  }
+
+  let currentPassengers = 0;
+  for (const change of timeline) {
+    currentPassengers += change;
+    if (currentPassengers > capacity) return false;
+  }
+
+  return true;
+};