Available question text
Simulate assigning tasks that arrive each second to servers, always choosing the available server with the smallest weight (breaking ties by index) and, if none are free, waiting until the next server frees; this is typically implemented using two priority queues (available by weight/index and busy by free time) to produce the assigned-server index for each task.
Related questions
Continue with questions that share topics or the same question type.
- Average Time of Process per Machine
Coding
- Count of Unfinished Tasks After Each Shift
Coding · Array · Binary Search · Prefix Sum
- Count Pairs of Connectable Servers in a Weighted Tree Network
Coding · Array · Depth-First Search · Tree
- Count Servers that Communicate
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1882. Process Tasks Using Servers
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source