Simple Java Solution
\n\n# Code\n\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n        boolean visited[] = new boolean[n];\n        int x=0;\n        int 
\n\n# Code\n```\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n        boolean visited[] = new boolean[n];\n        int x=0;\n        int i=1;\n        int visCount =0;\n        while(!visited[x]){\n            visited[x]=true;\n            visCount++;\n            x=(x+i*k)%n;\n            i++;\n        }\n        int ar[] = new int[n-visCount];\n        int pos =0;\n        for(int a=0;a<visited.length;a++){\n            if(!visited[a]){\n                ar[pos]=a+1;\n                pos++;\n            }\n\n        }\n        return ar;\n\n        \n    }\n}\n```
['Java']