Simple Python Solution using start and end
We don\'t care about number of cycles for this problem, just which sectors are most travelled.\n\nIf we know where the race starts and ends, we can just check t
We don\'t care about number of cycles for this problem, just which sectors are most travelled.\n\nIf we know where the race starts and ends, we can just check the sectors most visited using those values.\n\nFor example, for a 4 sector race, if we start at 1 and end at 3,  we know 1,2, and 3 are the most visited because no matter how many cycles you went, you went to 1/2/3 after that cycle (the cycle starts/ends at original start, 1 in this case)\n\nIf the end is before the start (ie started at 3 and ended at 1), we know we visited sectors 3 to end (3 to 4) and 1 to end (1 to 1) extra.\n\nIf the end equals the start, we did full cycles so we just use all the values of n.\n\nJust need to implement the ranges and we\'re done!\n\n\n```\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n    \n        start = rounds[0]\n        end = rounds[-1]\n        \n        if start == end:\n            return [start]\n        \n        if start < end:\n            return [x for x in range(start, end+1)]\n        \n        if start > end:\n            return [x for x in range(1, end+1)] + [x for x in range(start, n+1)] \n        \n      ```\n\t  \n\t
[]