Add solution #1701

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,485 LeetCode solutions in JavaScript
+# 1,486 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1310,6 +1310,7 @@
 1696|[Jump Game VI](./solutions/1696-jump-game-vi.js)|Medium|
 1697|[Checking Existence of Edge Length Limited Paths](./solutions/1697-checking-existence-of-edge-length-limited-paths.js)|Hard|
 1700|[Number of Students Unable to Eat Lunch](./solutions/1700-number-of-students-unable-to-eat-lunch.js)|Easy|
+1701|[Average Waiting Time](./solutions/1701-average-waiting-time.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|

solutions/1701-average-waiting-time.js

@@ -0,0 +1,37 @@
+/**
+ * 1701. Average Waiting Time
+ * https://leetcode.com/problems/average-waiting-time/
+ * Difficulty: Medium
+ *
+ * There is a restaurant with a single chef. You are given an array customers, where
+ * customers[i] = [arrivali, timei]:
+ * - arrivali is the arrival time of the ith customer. The arrival times are sorted in
+ *   non-decreasing order.
+ * - timei is the time needed to prepare the order of the ith customer.
+ *
+ * When a customer arrives, he gives the chef his order, and the chef starts preparing it once
+ * he is idle. The customer waits till the chef finishes preparing his order. The chef does not
+ * prepare food for more than one customer at a time. The chef prepares food for customers in
+ * the order they were given in the input.
+ *
+ * Return the average waiting time of all customers. Solutions within 10-5 from the actual
+ * answer are considered accepted.
+ */
+
+/**
+ * @param {number[][]} customers
+ * @return {number}
+ */
+var averageWaitingTime = function(customers) {
+  let totalWait = 0;
+  let currentTime = 0;
+
+  for (const [arrival, prepTime] of customers) {
+    const startTime = Math.max(arrival, currentTime);
+    const finishTime = startTime + prepTime;
+    totalWait += finishTime - arrival;
+    currentTime = finishTime;
+  }
+
+  return totalWait / customers.length;
+};