Add solution #1560

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,368 LeetCode solutions in JavaScript
+# 1,369 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1191,6 +1191,7 @@
 1557|[Minimum Number of Vertices to Reach All Nodes](./solutions/1557-minimum-number-of-vertices-to-reach-all-nodes.js)|Medium|
 1558|[Minimum Numbers of Function Calls to Make Target Array](./solutions/1558-minimum-numbers-of-function-calls-to-make-target-array.js)|Medium|
 1559|[Detect Cycles in 2D Grid](./solutions/1559-detect-cycles-in-2d-grid.js)|Medium|
+1560|[Most Visited Sector in a Circular Track](./solutions/1560-most-visited-sector-in-a-circular-track.js)|Easy|
 1566|[Detect Pattern of Length M Repeated K or More Times](./solutions/1566-detect-pattern-of-length-m-repeated-k-or-more-times.js)|Easy|
 1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](./solutions/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js)|Medium|
 1598|[Crawler Log Folder](./solutions/1598-crawler-log-folder.js)|Easy|

solutions/1560-most-visited-sector-in-a-circular-track.js

@@ -0,0 +1,48 @@
+/**
+ * 1560. Most Visited Sector in a Circular Track
+ * https://leetcode.com/problems/most-visited-sector-in-a-circular-track/
+ * Difficulty: Easy
+ *
+ * Given an integer n and an integer array rounds. We have a circular track which consists of n
+ * sectors labeled from 1 to n. A marathon will be held on this track, the marathon consists of
+ * m rounds. The ith round starts at sector rounds[i - 1] and ends at sector rounds[i]. For
+ * example, round 1 starts at sector rounds[0] and ends at sector rounds[1]
+ *
+ * Return an array of the most visited sectors sorted in ascending order.
+ *
+ * Notice that you circulate the track in ascending order of sector numbers in the counter-clockwise
+ * direction (See the first example).
+ */
+
+/**
+ * @param {number} n
+ * @param {number[]} rounds
+ * @return {number[]}
+ */
+var mostVisited = function(n, rounds) {
+  const sectorVisits = new Array(n + 1).fill(0);
+  let maxVisits = 0;
+
+  for (let i = 1; i < rounds.length; i++) {
+    let start = rounds[i - 1];
+    const end = rounds[i];
+
+    while (start !== end) {
+      sectorVisits[start]++;
+      maxVisits = Math.max(maxVisits, sectorVisits[start]);
+      start = start === n ? 1 : start + 1;
+    }
+  }
+
+  sectorVisits[rounds[rounds.length - 1]]++;
+  maxVisits = Math.max(maxVisits, sectorVisits[rounds[rounds.length - 1]]);
+
+  const result = [];
+  for (let i = 1; i <= n; i++) {
+    if (sectorVisits[i] === maxVisits) {
+      result.push(i);
+    }
+  }
+
+  return result;
+};