LeetCode 1606: Find Servers That Handled Most Number of Requests Solution

Master LeetCode problem 1606 (Find Servers That Handled Most Number of Requests), a hard challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1606. Find Servers That Handled Most Number of Requests

Hard

Array Greedy Heap (Priority Queue)Ordered Set

Problem Explanation

Explanation

To solve this problem, we can simulate the process of assigning requests to servers based on the given conditions. We will use two priority queues, one to keep track of available servers and another to keep track of servers that are currently busy. We will iterate through each request, assign it to an available server if possible, update the server's busy time, and move the server from available to busy.

After processing all requests, we will count the number of requests each server handled and find the busiest server(s).

Time complexity: O(n log k) where n is the number of requests and k is the number of servers
Space complexity: O(k) where k is the number of servers

Solution Code

import java.util.*;

class Solution {
    public List<Integer> busiestServers(int k, int[] arrival, int[] load) {
        List<Integer> result = new ArrayList<>();
        int[] count = new int[k];
        PriorityQueue<Integer> available = new PriorityQueue<>();
        PriorityQueue<Integer> busy = new PriorityQueue<>();
        
        for (int i = 0; i < k; i++) {
            available.offer(i);
        }
        
        int n = arrival.length;
        int time = arrival[0];
        
        for (int i = 0; i < n; i++) {
            time = Math.max(time, arrival[i]);
            while (!busy.isEmpty() && arrival[busy.peek()] <= time) {
                available.offer(busy.poll());
            }
            
            int serverIdx = i % k;
            while (!available.isEmpty() && load[i] > 0) {
                int server = (serverIdx + available.poll()) % k;
                count[server]++;
                busy.offer(server);
                load[i]--;
            }
        }
        
        int maxCount = Arrays.stream(count).max().getAsInt();
        for (int i = 0; i < k; i++) {
            if (count[i] == maxCount) {
                result.add(i);
            }
        }
        
        return result;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1606 (Find Servers That Handled Most Number of Requests)?

This page provides optimized solutions for LeetCode problem 1606 (Find Servers That Handled Most Number of Requests) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1606 (Find Servers That Handled Most Number of Requests)?

The time complexity for LeetCode 1606 (Find Servers That Handled Most Number of Requests) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1606 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1606 in Java, C++, or Python.

Back to LeetCode Solutions