Poetic Solution || Experimental solution || C++
Code in Poem\n\nAmidst a circle of players fair,\nA game is played with utmost care.\nEvery kth player must be gone,\nUntil just one is left alone.\n\nTo simula
# Code in Poem\n\nAmidst a circle of players fair,\nA game is played with utmost care.\nEvery kth player must be gone,\nUntil just one is left alone.\n\nTo simulate this game we\'ll try,\nUsing a map to bid goodbye.\nEliminating till the end,\nKeeping track of all our friends.\n\nWith time complexity of n,\nAnd space complexity of the same yen.\nThe code we\'ll write in just a snap,\nTo solve the problem with a tap.\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> circularGameLosers(int n, int k) {\n         vector<int> ans;\n        map<int,int> mp;\n        int i=1,j=k;\n       \n        \n        while(mp.find(i)==mp.end())\n        {\n            mp[i]++;\n            i = (i+k)%n;\n            if(i == 0)\n            {\n                i = n;\n            }\n            \n            k=k+j;\n            \n        }\n        \n        for(int i=1;i<=n;i++)\n        {\n            if(mp.find(i) == mp.end())\n            {\n                ans.push_back(i);\n            }\n        }\n        \n        return ans;\n    }\n};\n```
['C++']