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 the benefits of the circular queue is that we can make use of the spaces in front of the queue. In a normal queue, once the queue becomes full, we cannot insert the next element even if there is a space in front of the queue. But using the circular queue, we can use the space to store new values.

Implementation the MyCircularQueue class:


	MyCircularQueue(k) Initializes the object with the size of the queue to be k.
	int Front() Gets the front item from the queue. If the queue is empty, return -1.
	int Rear() Gets the last item from the queue. If the queue is empty, return -1.
	boolean enQueue(int value) Inserts an element into the circular queue. Return true if the operation is successful.
	boolean deQueue() Deletes an element from the circular queue. Return true if the operation is successful.
	boolean isEmpty() Checks whether the circular queue is empty or not.
	boolean isFull() Checks whether the circular queue is full or not.


You must solve the problem without using the built-in queue data structure in your programming language.&nbsp;

&nbsp;
Example 1:

Input
["MyCircularQueue", "enQueue", "enQueue", "enQueue", "enQueue", "Rear", "isFull", "deQueue", "enQueue", "Rear"]
[[3], [1], [2], [3], [4], [], [], [], [4], []]
Output
[null, true, true, true, false, 3, true, true, true, 4]

Explanation
MyCircularQueue myCircularQueue = new MyCircularQueue(3);
myCircularQueue.enQueue(1); // return True
myCircularQueue.enQueue(2); // return True
myCircularQueue.enQueue(3); // return True
myCircularQueue.enQueue(4); // return False
myCircularQueue.Rear();     // return 3
myCircularQueue.isFull();   // return True
myCircularQueue.deQueue();  // return True
myCircularQueue.enQueue(4); // return True
myCircularQueue.Rear();     // return 4


&nbsp;
Constraints:


	1 &lt;= k &lt;= 1000
	0 &lt;= value &lt;= 1000
	At most 3000 calls will be made to&nbsp;enQueue, deQueue,&nbsp;Front,&nbsp;Rear,&nbsp;isEmpty, and&nbsp;isFull.


class MyCircularQueue {

    int head = -1;
    int tail = -1;
    int[] q;
    int k;
    
    public MyCircularQueue(int k) {
        q = new int[k];
        this.k = k;
    }
    
    public boolean enQueue(int value) {
        if(head == -1 && tail == -1) {
            // enqueue when the queue is empty
            head = tail = 0;
            q[tail] = value;    // enQueue done
            return true;
        }
        if((tail == k-1 && head == 0) || tail+1 == head) {
            // queue is full
            return false;
        }
        tail++;
        if(tail == k) // condition for circularity
            tail = 0;
        q[tail] = value;    // enQueue done
        return true;
    }
    
    public boolean deQueue() {
        if(head == -1) {
            // check if q is already empty
            return false;
        } 
        if(head == tail) {
            // only 1 element is there and head,tail both points same index
            head = tail = -1;   // deQueue done
            return true;
        }
        head++;       // deQueue done
        if(head == k) // condition for circularity
            head = 0;
        return true;
    }
    
    public int Front() {
        if(head == -1) 
            return -1;
        return q[head];
    }
    
    public int Rear() {
        if(tail == -1) 
            return -1;
        return q[tail];
    }
    
    public boolean isEmpty() {
        if(head == -1 && tail == -1) 
            return true;
        return false;
    }
    
    public boolean isFull() {
        if(tail == k-1 || tail+1 == head) 
            return true;
        return false;
    }
}

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue obj = new MyCircularQueue(k);
 * boolean param_1 = obj.enQueue(value);
 * boolean param_2 = obj.deQueue();
 * int param_3 = obj.Front();
 * int param_4 = obj.Rear();
 * boolean param_5 = obj.isEmpty();
 * boolean param_6 = obj.isFull();
 */
class MyCircularQueue {

    private int front;
    private int rear;
    private int[] arr;
    private int cap;
    
    private int next(int i){ // to get next idx after i in circular queue
        return (i+1)%cap;
    }
    private int prev(int i){ // to get prev idx before i in circular queue
        return (i+cap-1)%cap;
    }
    
	// rest is as simple as implmenting a normal queue using array.
    public MyCircularQueue(int k) {
        arr = new int[k];
        cap=k;
        front=-1;
        rear=-1;
    }
    
    public boolean enQueue(int value) {
        if(isFull())return false;
        if(front==-1){
            front=0;
            rear=0;
            arr[rear]=value;
            return true;
        }
        rear = next(rear);
        arr[rear]=value;
        return true;
    }
    
    public boolean deQueue() {
        if(isEmpty())return false;
        if(front==rear){
            front=-1;
            rear=-1;
            return true;
        }
        front=next(front);
        return true;
    }
    
    public int Front() {
        if(front==-1)return -1;
        return arr[front];
    }
    
    public int Rear() {
        if(rear==-1)return -1;
        return arr[rear];
    }
    
    public boolean isEmpty() {
        return front==-1;
    }
    
    public boolean isFull() {
        return front!=-1 && next(rear)==front;
    }
}
class MyCircularQueue {

    int head = -1;
    int tail = -1;
    int[] q;
    int k;
    
    public MyCircularQueue(int k) {
        q = new int[k];
        this.k = k;
    }
    
    public boolean enQueue(int value) {
        if(head == -1 && tail == -1) {
            // enqueue when the queue is empty
            head = tail = 0;
            q[tail] = value;    // enQueue done
            return true;
        }
        if((tail == k-1 && head == 0) || tail+1 == head) {
            // queue is full
            return false;
        }
        tail++;
        if(tail == k) // condition for circularity
            tail = 0;
        q[tail] = value;    // enQueue done
        return true;
    }
    
    public boolean deQueue() {
        if(head == -1) {
            // check if q is already empty
            return false;
        } 
        if(head == tail) {
            // only 1 element is there and head,tail both points same index
            head = tail = -1;   // deQueue done
            return true;
        }
        head++;       // deQueue done
        if(head == k) // condition for circularity
            head = 0;
        return true;
    }
    
    public int Front() {
        if(head == -1) 
            return -1;
        return q[head];
    }
    
    public int Rear() {
        if(tail == -1) 
            return -1;
        return q[tail];
    }
    
    public boolean isEmpty() {
        if(head == -1 && tail == -1) 
            return true;
        return false;
    }
    
    public boolean isFull() {
        if(tail == k-1 || tail+1 == head) 
            return true;
        return false;
    }
}

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue obj = new MyCircularQueue(k);
 * boolean param_1 = obj.enQueue(value);
 * boolean param_2 = obj.deQueue();
 * int param_3 = obj.Front();
 * int param_4 = obj.Rear();
 * boolean param_5 = obj.isEmpty();
 * boolean param_6 = obj.isFull();
 */
class MyCircularQueue {

    int head = -1;
    int tail = -1;
    int[] q;
    int k;
    
    public MyCircularQueue(int k) {
        q = new int[k];
        this.k = k;
    }
    
    public boolean enQueue(int value) {
        if(head == -1 && tail == -1) {
            // enqueue when the queue is empty
            head = tail = 0;
            q[tail] = value;    // enQueue done
            return true;
        }
        if((tail == k-1 && head == 0) || tail+1 == head) {
            // queue is full
            return false;
        }
        tail++;
        if(tail == k) // condition for circularity
            tail = 0;
        q[tail] = value;    // enQueue done
        return true;
    }
    
    public boolean deQueue() {
        if(head == -1) {
            // check if q is already empty
            return false;
        } 
        if(head == tail) {
            // only 1 element is there and head,tail both points same index
            head = tail = -1;   // deQueue done
            return true;
        }
        head++;       // deQueue done
        if(head == k) // condition for circularity
            head = 0;
        return true;
    }
    
    public int Front() {
        if(head == -1) 
            return -1;
        return q[head];
    }
    
    public int Rear() {
        if(tail == -1) 
            return -1;
        return q[tail];
    }
    
    public boolean isEmpty() {
        if(head == -1 && tail == -1) 
            return true;
        return false;
    }
    
    public boolean isFull() {
        if(tail == k-1 || tail+1 == head) 
            return true;
        return false;
    }
}

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue obj = new MyCircularQueue(k);
 * boolean param_1 = obj.enQueue(value);
 * boolean param_2 = obj.deQueue();
 * int param_3 = obj.Front();
 * int param_4 = obj.Rear();
 * boolean param_5 = obj.isEmpty();
 * boolean param_6 = obj.isFull();
 */
Design Circular Queue