Easy | Brute Force
Code\n\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n        Set<Integer> gotBall = new HashSet<>();\n        \n        for(int i=1,mu
# Code\n```\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n        Set<Integer> gotBall = new HashSet<>();\n        \n        for(int i=1,mul=1;!gotBall.contains(i); i = (i+(k*mul))%n,mul++){\n            gotBall.add(i);\n        }\n        if(gotBall.contains(0)){\n            gotBall.add(n);\n            gotBall.remove(0);\n        }\n        int[] ans = new int[n-gotBall.size()];\n        int index = 0;\n        for(int i=1;i<=n;i++) if(!gotBall.contains(i)) ans[index++] = i;\n        return ans;\n    }\n}\n```
['Java']