&% runtime performance, with my own brute force solution
Code\npython3 []\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n        # add losers - which never increased during a game\n 
# Code\n```python3 []\nclass Solution:\n    def circularGameLosers(self, n: int, k: int) -> List[int]:\n        # add losers - which never increased during a game\n        # create object and increase the numbers of its players\n        # if any element\'s count reached 3 the game will be ended\n        obj = {}\n        res = []\n        for i in range(1, n+1):\n            res.append(i)\n            obj[i] = obj.get(i, 0)+1\n        a = 0\n        n=1\n        while True:\n            if a>len(res) -1:\n                while a>=len(res):\n                    a -= len(res)\n            obj[res[a]] += 1\n            if obj[res[a]] == 3:\n                break\n            a+=n*k\n            n+=1\n        return [x for x in obj if obj[x] == 1]\n\n\n```
['Python3']