Pass yo partner around, ezzzz....
Intuition\n1)Keep track of where the ball has been by using a set seen\n2)Move the ball be adding its currentPos + (how many times its been passed) *(k). Then m
# Intuition\n1)Keep track of where the ball has been by using a set seen\n2)Move the ball be adding its currentPos + (how many times its been passed) *(k). Then mod it by n\n3)Do this until you land on a space that is already in seen\n4)Substract all the numbers in the range(n) from seen and increase them by 1\n5)Return 4) in sorted fashion\n# Code\n```\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n        seen = set()\n        currPos, passes = 0,1\n        while currPos not in seen:\n            seen.add(currPos)\n            currPos = (currPos + passes*k) % n\n            passes+= 1\n        \n        ans = set([i for i in range(n)]) - seen\n        return sorted([i + 1 for i in ans])        \n```
['Python3']