C++ || Easy || Set solution
\n        vector circularGameLosers(int n, int k)\n        {\n            unordered_set s;\n            \n            int curr = 1, i = 1;\n            \n      
\n        vector<int> circularGameLosers(int n, int k)\n        {\n            unordered_set<int> s;\n            \n            int curr = 1, i = 1;\n            \n            while (s.find(curr) == s.end())//stopping condition\n            {\n                s.insert(curr);//mask as visited\n                curr = (curr + i *k ) % n;\n                if (curr == 0) curr = n;\n                i++;\n            }\n            vector<int> ans;\n            for (int i = 1; i <= n; i++)//check which are not visited\n            {\n                if (s.find(i) == s.end())\n                    ans.push_back(i);\n            }\n            return ans;\n        }\n
['C', 'Ordered Set', 'C++']