Python solution O(n) 98.35%
\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n\n        if rounds[0] == rounds[-1]:\n            return [rounds[0]]\n  
```\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n\n        if rounds[0] == rounds[-1]:\n            return [rounds[0]]\n        \n        arr = []\n        \n        if rounds[0] < rounds[-1]:\n            for i in range(rounds[0], rounds[-1] + 1):\n                arr.append(i)\n            \n        else:\n            for i in range(rounds[0], rounds[-1] + n + 1):\n                if i == n:\n                    arr.append(n)\n                else:\n                    arr.append(i % n)\n            \n        return sorted(arr)\n\t\t```
[]