CircularQueue

Function Name: circularQueue

Description

In this challenge, you are tasked with implementing a Circular Queue data structure. The circular queue is a linear data structure that follows the First In First Out (FIFO) principle but also connects the last position back to the first position to make a circle. It is ideal for scenarios where the queue needs to be reset after it reaches the end.

Your implementation should support the following operations: enqueue, which inserts an element at the rear of the queue; dequeue, which removes and returns the element from the front of the queue; peek, which returns the front-most element without removing it from the queue; and isEmpty, which checks whether the queue is empty.

Requirements

• The circularQueue function should have a parameter size indicating the maximum number of elements the queue can hold.
• The queue should handle integer data, and when full, it should not enqueue new elements until space is freed up by dequeue operations.
• Enqueue operation should return a boolean indicating whether the operation was successful.
• Dequeue operation should return null (or equivalent) if there are no elements to remove.
• Peek operation should return null if the queue is empty.
• Implement an isEmpty method that returns a boolean indicating whether the queue is empty.
• You should not use built-in queue or deque data structures provided by the language's standard libraries.

Examples

// Create a circular queue of size 3let cq = circularQueue(3);// Fill the queue completelycq.enqueue(1); // returns truecq.enqueue(2); // returns truecq.enqueue(3); // returns true// Check if queue is fullcq.enqueue(4); // returns false// Get the current front elementcq.peek(); // returns 1// Remove an element from the queuecq.dequeue(); // returns 1cq.peek(); // returns 2// Check if the queue is emptycq.isEmpty(); // returns false