C++ - Iterative
\nclass Solution {\npublic:\n    vector<int> circularGameLosers(int n, int k) {\n\t\t// Here I\'ve used 0 based indexing, so range will be [0, ..., n-1].\n\t\t\
```\nclass Solution {\npublic:\n    vector<int> circularGameLosers(int n, int k) {\n\t\t// Here I\'ve used 0 based indexing, so range will be [0, ..., n-1].\n\t\t\n\t\t// Assign the ball count for all friends to 0.\n        vector<int> count(n, 0), res;\n\t\t\n\t\t// We start from the first friend, \n\t\t// so assign starting value for first friend to 1.\n        int start = 0, i = 1;\n        count[start] = 1;\n        \n\t\t// Loop until we found the friend which got 2nd time ball\n        while(count[start] != 2)\n        {\n            start = (start + (i * k)) % n;\n            count[start]++;\n            i++;\n        }\n        \n        for(int i = 0; i < n; i++)\n        {\n            if(count[i] == 0)\n                res.push_back(i + 1);\n        }\n        return res;\n    }\n};\n```
['C']