simple dict solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def circularGameLosers(self, n: int, k: int) -> List[int]:
        d = defaultdict(bool)
        i = 0
        c = 0
        x = 0
        res = []
    
        while True:
            x = (i + c *k) % (n)
            #print("x",x,d)
            if x in d:
                break
            else:
                d[x] = True
                i = x
                c +=1
        #print(x,i)        

        for i in range(1,n+1):
            if i-1 not in d:
                res.append(i) 
        return res          



```
['Array', 'Hash Table', 'Simulation', 'Python3']