PYTHON LINEAR solution (40ms)
\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        \n        #So, all we care about is where we started\n        #Th
```\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        \n        #So, all we care about is where we started\n        #The first element in rounds\n        \n        #And where we ended which is the\n        #The last element\n        \n        #We know we are going in a circle\n        #So, from the starting to the ending element\n        #Will be the most frequently visited sections\n        \n        #Regardless of how many rounds we actually completed\n        \n        soln = [];\n        \n        # So we take the start, and the end elements\n        start = rounds[ 0 ];\n        end = rounds[ -1 ];\n        \n        #While we are not at the end,\n        while start != end :\n            #Append the solution\n            soln.append( start );\n            #Increment start\n            start += 1;\n            \n            #And if we have gone outside the n bound, reset to 1\n            if start > n :\n                start = 1;\n                \n        #Once we hit the end, we have to include the end itself:\n        soln.append( end);\n             \n        #For simplicity, we use the built in sorted() to format the solution\n        #To an ascending order\n        return sorted( soln );\n\t\t\n\t\t#This is a linear time to n, and constant time to the number of rounds solution.\n\t\t#So even if we have expontentially more rounds, we only use the first and last element\n\t\t#But when n increases, the work is bounded by n\n\t\t#The worse case scenario, we will have to walk n times to get the correct values\n\t\t\n\t\t#As for the sorting at the end, We could simply have two separate lists\n\t\t#One list takes in values as start increments\n\t\t#The lists then can switch if and when start resets to 1 in the while loop\n\t\t#This was not implemented for simplicity.\n\t\t#But is noted to show that sorting is overkill\n        \n```
[]