Simple Python solution using Set
Complexity\n- Time complexity: O(n)\n\n- Space complexity: O(n)\n\n# Code\n\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n  
# Complexity\n- Time complexity: $$O(n)$$\n\n- Space complexity: $$O(n)$$\n\n# Code\n```\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n        winners = set()\n        pos, i = 0, 1\n        winners.add(1)\n        while True:\n            pos = (pos+(k*i))%(n)\n            if pos+1 in winners:\n                break\n            winners.add(pos+1)\n            i+=1\n        result = []\n        for t in range(1, n+1):\n            if t not in winners: result.append(t)\n        return result\n\n```
['Python3']