Python, Intuitive and Fast
\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        start_loc = rounds[0]\n        end_loc = rounds[-1]\n        ans 
```\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        start_loc = rounds[0]\n        end_loc = rounds[-1]\n        ans = []\n        if (start_loc == end_loc):\n                return [start_loc]  \n        elif (start_loc < end_loc):\n            ans = list(range(start_loc, end_loc+1))\n        elif (start_loc > end_loc):\n            ans = list(range(1, end_loc+1))\n            ans += list(range(start_loc, n+1))\n        \n        return ans\n```
[]