Simple Short C++ Solution | TC : O(N) | SC : O(N)
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:O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> circularGameLosers(int n, int k) {\n        vector<int> v(n+1,0);\n        int j = 1;\n        vector<int> ans;\n        for(int i =1;i<=n;i++){\n            if((j%n==0 && v[n]==1)||(v[j%n]==1)) break;\n            else{\n                if(j%n==0) v[n]=1;\n                else v[j%n]=1;   \n                j+=(i*k)%n;\n            }\n        }\n        for(int i =1;i<n+1;i++){\n            if(v[i]==0) ans.push_back(i);\n        }\n        return ans;\n    }\n};\n```
['C++']