Use a circular array, as described in Segments 11.8 and 11.9, to implement the queue. Count entries to ascertain whether the queue is empty or full.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.