Description
Solutions
Assign Tasks to Servers

You have an integer servers, which denote the number of servers, and you have a list called requests which denote the servers that this request is allowed to be scheduled to. You have to schedule each request to a server among servers 0 to requests[i] (inclusive) such that it is the least busy server. If multiple servers are the least, use the one with the least index. Return a list containing the server where each request was served.

Example 1: 

Input:  servers = 5, requests = [3, 1, 0, 2, 1]
Output: [0, 1, 0, 2, 1] 
Explanation:

N/A
Constraints:
    N/A
Thumbnail 0
Testcase
Result
Case 1

input:

output: