Easy JAVA Solution || 100 Faster
\n\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n       \n        Set<Integer> set=new HashSet<>();\n        set.add(1);\n        int 
\n```\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n       \n        Set<Integer> set=new HashSet<>();\n        set.add(1);\n        int i=1;\n        int m=1;\n        while(true)\n        {\n            int cal=m*k;\n            m++;\n            int current = cal+i;\n            i=current%n;\n            if(i==0) i=n;\n            if(set.contains(i))\n            {\n                break;\n            }\n            set.add(i); \n        }\n        int []arr=new int[n-set.size()];\n        int j=0;\n        for(i=2;i<=n;i++)\n        {\n            if(!set.contains(i)) arr[j++]=i;\n        }\n        return arr;\n    }\n}\n```
['Java']