# Find Servers That Handled Most Number Of Requests: Practice Notes
Find Servers That Handled Most Number Of Requests shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
k servers; request i starts at arrival[i] and lasts load[i], assigned to the next free server in circular order (or dropped). Track busy servers in a min-heap of (free_time, id) and free ids in a sorted structure so you can lower_bound (i % k).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log k).
## Common mistake
Linear-scanning all k servers per request, or wrapping incorrectly so server 0 is always preferred.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI help for online coding assessments.