Simple Bruteforce
\nUp vote if you like the solution\n\n# Approach \n1. Just take an array and keep tracking its value with bruteforce.\n    \n# Code\n\n\nvector<int> circularGam
\n<b>Up vote if you like the solution</b>\n\n# Approach \n1. Just take an array and keep tracking its value with bruteforce.\n    \n# Code\n\n```\nvector<int> circularGameLosers(int n, int k) {\n    vector<int> v(n, 0);\n    int i = 1, t = 0; \n    while(v[i-1] == 0){\n        v[i-1] = 1;\n        t = t + k;\n        i = (i + t)%n;\n        if(i == 0) i = n;\n    }\n    vector<int> ans;\n    for(int i = 0; i < v.size(); ++i){\n        if(v[i] == 0) ans.push_back(i+1);\n    }\n    return ans;\n}\n```\n\n<b>Here is an article of my last interview experience - A Journey to FAANG Company, I recomand you to go through this to know which all resources I have used & how I cracked interview at Amazon:\nhttps://leetcode.com/discuss/interview-experience/3171859/Journey-to-a-FAANG-Company-Amazon-or-SDE2-(L5)-or-Bangalore-or-Oct-2022-Accepted
['C++']