Skip to content

problem10.md

Latest commit

 

History

History
11 lines (8 loc) · 554 Bytes

problem10.md

File metadata and controls

11 lines (8 loc) · 554 Bytes

Problem 10: Seamless Ring Buffer

Problem Statement

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".

Input Format

  • Capacity and various method calls.

Example

Input: ["MyCircularQueue", "enQueue", "enQueue", "deQueue", "Front"] [[3], [1], [2], [], []]
Output: [null, True, True, True, 1]