100%, pretty compact
python3 []\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        s, e, res = rounds[0] - 1, rounds[-1] - 1, [rounds[-1]]
```python3 []\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        s, e, res = rounds[0] - 1, rounds[-1] - 1, [rounds[-1]]\n        while s != e:\n            res.append(s + 1)\n            s = (s + 1) % n\n        return sorted(res)\n```
['Python3']