Circular Queue Implementation

Function Name: CircularQueue

Description

Implement a Circular Queue data structure using an array. The circular queue should support the following operations: enqueue, dequeue, peek, and isEmpty.

The enqueue operation should add an item to the back of the queue if there is space. If the queue is full, it should return 'Queue Full'.

The dequeue operation should remove an item from the front of the queue and return it. If the queue is empty, it should return 'Queue Empty'.

The peek operation should return the item at the front of the queue without removing it. If the queue is empty, it should return 'Queue Empty'.

The isEmpty operation should check if the queue is empty and return a boolean value.

Requirements

• The CircularQueue constructor function should take one parameter, the maximum size of the queue.
• Do not use built-in language features that mimic the behavior of a queue directly.
• You must handle the wrap-around behavior characteristic of a circular queue.
• Ensure that your implementation avoids the 'Queue Overflow' and 'Queue Underflow' problems.
• Write helper methods as needed to keep your code modular and readable.

Examples

let cq = new CircularQueue(3); // creates a circular queue with a max size of 3cq.enqueue(10); // queue is now [10]cq.enqueue(20); // queue is now [10, 20]cq.enqueue(30); // queue is now [10, 20, 30]cq.enqueue(40); // returns 'Queue Full'cq.dequeue(); // returns 10, queue is now [20, 30]cq.peek(); // returns 20cq.isEmpty(); // returns falsecq.dequeue(); // returns 20cq.dequeue(); // returns 30cq.isEmpty(); // returns true

Links