java Simple Solution using HashSet
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      HashSet<Integer> set = new HashSet<>();\n\n        int i=0;\n        int count=0;\n    while(true)\n        {\n        \n            i=i+k*count++;\n            i=i%n;\n         if(set.contains(i)) break;\n         else set.add(i);\n        \n        }\n     int[]  result = new int[n-set.size()];\n     int j=0;\n        for( i=0;i<n;i++)\n        {\n            if(!set.contains(i))\n            {\n               result[j++]=i+1;\n            }\n        }\n        return result;\n    }\n}\n```
['Java']