Loser Of Circular Game O(n) time with 100% beats🚀🚀
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$$O(n)$$\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<int> circularGameLosers(int n, int k) {\n        int it=1,hold=1;\n        vector<int> arr(n+1,0);\n\n        while(arr[hold]!=1){\n            arr[hold]++;\n            hold=((hold+it*k)%n);\n            if(hold==0)\n            hold=n;\n            it++;\n        }\n        vector<int> res;\n        for(int it=1;it<=n;it++){\n            if(arr[it]==0)\n            res.push_back(it);\n        }\n        return res;\n    }\n};\n```
['Array', 'Hash Table', 'Math', 'Two Pointers', 'Simulation', 'C++']