Java Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int[] circularGameLosers(int n, int k) {\n        int i=0,rem=0;\n        ArrayList<Integer> set=new ArrayList<>();\n        while(true){\n            rem=(rem+(k*i))%n;\n            if(set.contains(rem+1)){\n                break;\n            }\n            else{\n                set.add(rem+1);\n            }\n            i++;\n        }\n        ArrayList<Integer> list=new ArrayList<>();\n        for(i=1;i<=n;i++){\n           if(!set.contains(i)){\n               list.add(i);\n           }\n        }\n        int ans[]=new int[list.size()];\n        for( i=0;i<list.size();i++){\n            ans[i]=list.get(i);\n        }\n        return ans;\n        \n    }\n}\n```
['Java']