Design Circular Queue at Optiver
Medium54.0% acceptance
This problem has 100.0% frequency at Optiver.
Problem Description
Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle, and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer". One of...
Read full problem and hints