Circular Array
# Complexity\n- Time complexity:\n$$O(n)$$\n\n- Space complexity:\n$$O(n)$$\n\n# Code\n```golang []\nfunc circularGameLosers(n int, k int) []int {\n    // if game[i] == 0 -> doesn\'t play yet\n\t// if game[i] == 1 -> already played\n\tgamers := make([]int, n)\n\tvar j int\n\tfor i := 1; gamers[j] == 0; i++ {\n\t\tgamers[j] = 1\n\t\tj = (j + (i * k)) % n\n\t}\n\tlosers := []int{}\n\tfor i := range gamers {\n\t\tif gamers[i] == 0 {\n\t\t\tlosers = append(losers, i+1)\n\t\t}\n\t}\n\treturn losers   \n}\n```
['Go']