Easy to understand brute force solution
\nfunc busiestServers(k int, arrival []int, load []int) []int {\n    serverReqCount := make([]int, k)\n    servers := make([]int, k)\n    \n    maxRequestServed
```\nfunc busiestServers(k int, arrival []int, load []int) []int {\n    serverReqCount := make([]int, k)\n    servers := make([]int, k)\n    \n    maxRequestServed := 0  // max request served by any sever \n    \n    for i:=0; i<len(arrival); i++ {\n        arrivalTime := arrival[i]\n        duration := load[i]\n        nextServer := i % k // request will go to this server as per questioon\n        for j:=0; j<k; j++ { // iterate over all servers \n            if nextServer == k {  // reached to last server, start from frist\n                nextServer = 0\n            }\n            if servers[nextServer] <= arrivalTime {\n                servers[nextServer] = arrivalTime + duration  // serving requat till this time\n                serverReqCount[nextServer]++\n                \n                if maxRequestServed < serverReqCount[nextServer] {\n                    maxRequestServed = serverReqCount[nextServer]\n                }\n                break\n            }\n            nextServer++\n        }\n    \n    }\n    \n    result := []int{}\n    // all servers which served max request\n    for i:=0; i<len(serverReqCount); i++ {\n        if serverReqCount[i] == maxRequestServed {\n            result = append(result, i)\n        }\n    }\n    \n    return result\n}\n```
['Go']