← All problemsSign in

Waiting in a Queue

You have n requests in a queue, and each request has distinct owner. That is, there are n owners, and each of them own exactly one of the requests. The requests are numbered from 1 to n, and they are initially in order in the queue. That is, Request 1 is at the head (beginning) of the queue, and Request n is at the tail (end). The process starts at time = 1, ie. the first minute. But not all the o

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start