100% beat. 20 ms.
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: $$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution(object):\n    def circularGameLosers(self, n, k):\n\n        # creating array of elements who in future will loosers \n        loosers = set(range(1, n+1))\n\n        # initialize the position\n        step = 1\n\n        # multiplied value on every step\n        mult = 1\n\n        # Start the game! (loop will continue untill loosers have spep, if not, then that player already taken ball and we should end the game)\n        while step in loosers:\n\n            # remove current elem from user because we selected it\n            loosers.remove(step)\n\n            # calculate next step by that formula\n            step = (step + mult * k) % n\n\n            # fix corner step when step is 0\n            step = step or n\n\n            # increase multiply\n            mult += 1 \n\n        # now just return loosers array after loop ends\n        return loosers\n```
['Python']