Simple Solution
Code\npython []\nclass Solution(object):\n    def mostVisited(self, n, rounds):\n        d = {i:0 for i in range(1,n+1)}\n        for i in range(len(rounds)-1):
# Code\n```python []\nclass Solution(object):\n    def mostVisited(self, n, rounds):\n        d = {i:0 for i in range(1,n+1)}\n        for i in range(len(rounds)-1):\n            start = rounds[i]\n            end = rounds[i+1]\n            while start != end:\n                if start > n:\n                    start = 1\n                else:\n                    d[start]+=1\n                    start+=1\n        else:\n            d[end]+=1\n        l = sorted(d.items(),key = lambda x: x[1])\n        return [i[0] for i in l if i[1] == l[-1][1]]\n```
['Python', 'Python3']