Add solution #1184

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,169 LeetCode solutions in JavaScript
+# 1,170 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -917,6 +917,7 @@
 1175|[Prime Arrangements](./solutions/1175-prime-arrangements.js)|Easy|
 1177|[Can Make Palindrome from Substring](./solutions/1177-can-make-palindrome-from-substring.js)|Medium|
 1178|[Number of Valid Words for Each Puzzle](./solutions/1178-number-of-valid-words-for-each-puzzle.js)|Hard|
+1184|[Distance Between Bus Stops](./solutions/1184-distance-between-bus-stops.js)|Easy|
 1189|[Maximum Number of Balloons](./solutions/1189-maximum-number-of-balloons.js)|Easy|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|
 1206|[Design Skiplist](./solutions/1206-design-skiplist.js)|Hard|

solutions/1184-distance-between-bus-stops.js

@@ -0,0 +1,30 @@
+/**
+ * 1184. Distance Between Bus Stops
+ * https://leetcode.com/problems/distance-between-bus-stops/
+ * Difficulty: Easy
+ *
+ * A bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between
+ * all pairs of neighboring stops where distance[i] is the distance between the stops number
+ * i and (i + 1) % n.
+ *
+ * The bus goes along both directions i.e. clockwise and counterclockwise.
+ *
+ * Return the shortest distance between the given start and destination stops.
+ */
+
+/**
+ * @param {number[]} distance
+ * @param {number} start
+ * @param {number} destination
+ * @return {number}
+ */
+var distanceBetweenBusStops = function(distance, start, destination) {
+  const normalizeIndices = (from, to) => from < to ? [from, to] : [to, from];
+
+  const [left, right] = normalizeIndices(start, destination);
+  const clockwiseDistance = distance.slice(left, right).reduce((sum, dist) => sum + dist, 0);
+  const totalDistance = distance.reduce((sum, dist) => sum + dist, 0);
+  const counterclockwiseDistance = totalDistance - clockwiseDistance;
+
+  return Math.min(clockwiseDistance, counterclockwiseDistance);
+};