HashSet JAVA solution || Intuitive
\n# Code\n\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n        int multiplier =1;\n        HashSet<Integer> set = new HashSet<>();\n
\n# Code\n```\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n        int multiplier =1;\n        HashSet<Integer> set = new HashSet<>();\n        int winner =0;\n        \n        while(true){\n            set.add(winner);\n            winner = (winner +multiplier*k) % n;\n            multiplier++;\n            if(set.contains(winner)){\n                break;\n            }\n        }\n        \n        int size = n -set.size();\n        int[] ans =new int[size];\n        int index =0;\n        \n        for(int i=0; i< n; i++){\n            if(!set.contains(i)){\n                ans[index++] = i+1;\n            }\n        }\n        return ans;\n    }\n}\n```
['Java']