Python: Faster than 100%
All you have to return is the sorted range from start sector to last sector.\n\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[in
All you have to return is the sorted range from start sector to last sector.\n```\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        if(rounds[0]<=rounds[-1]):\n            return range(rounds[0], rounds[-1]+1)\n        else:\n            return list(range(1, rounds[-1]+1)) + list(range(rounds[0],n+1))\n```
[]