Problem Brief

Schedule Requests 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 busy, use the one with the least index. Return a list containing the server where each request was served.

1Example 1

Input

servers = 5, requests = [3, 1, 0, 2, 1]

Output

[0, 1, 0, 2, 1]

Explanation

An unknown myth for now 🤧 If you know about it, I’d be delighted to hear from you! 🍻 You da best! 👍

Draft autosaves locally

public int[] scheduleRequestsToServers(int servers, int[] requests) {
  // write your code here
}

Input

servers

requests

[3, 1, 0, 2, 1]

Output

[0, 1, 0, 2, 1]