🔥C++ ✅✅ Best Solution ( 🔥  🔥 ) Easy to Understand💯💯 ⬆⬆⬆
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# Co
# 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> vis(n, 0);\n        int i=0, j=1;\n        while(1)    {\n            if(vis[i] == 1) break;\n            vis[i] = 1;\n            i = (i + j*k) % n;\n            j++;\n        }\n        vector<int> ans;\n        for(int i=0; i<n; i++)  {\n            if(vis[i] == 0) ans.push_back(i+1);\n        }\n        \n        return ans;\n    }\n};\n\n```
['Array', 'Hash Table', 'Math', 'C++']