simple python solution with simple logic happy coding.....
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:
        dic={}
        for i in range(len(rounds)-1):
            k=rounds[i]
            if k not in dic:
                dic[k]=1
            else:
                dic[k]+=1
            while k!=rounds[i+1]:
                if k!=rounds[i]:
                    if k not in dic:
                        dic[k]=1
                    else:
                        dic[k]+=1
                k+=1
                if k>n:
                    k=1
        k=rounds[len(rounds)-1]
        if k not in dic:
            dic[k]=1
        else:
            dic[k]+=1
        max1=max(dic.values())
        m=[]
        for i in dic:
            if dic[i]==max1:
                m.append(i)
        m.sort()
        return m
            
            
                    
                    

        
        
```
['Python3']