circularQueue_practice.c++

#include <iostream>
using namespace std;

class CircularQueue{
    int *arr;
    int front;
    int rear;
    int size;

    public:

    CircularQueue(int n)
    {
        size = n;
        arr = new int[size];
        front = rear = 0;
    }

    bool enqueue(int data)
    {
        if((front == 0 && rear == size-1) || (rear == (front-1)%(size-1)))
        {
            return false;
        }
        else if(front == -1)
        {
            front = rear = 0;
        }
        else if((front != 0) && (rear = size-1))
        {
            rear = 0;
        }
        else
        {
            rear++;
        }

        arr[rear] = data;

        return true;
    }

    int deque()
    {
        if(front == -1)
        {
            return -1;
        }
        int ans = arr[front];
        arr[front] = -1;
        if(front == rear)
        {
            front = rear = -1;
        }
        else if(front == size - 1)
        {
            front = 0;
        }
        else
        {
            front++;
        }
        return ans;
    }
};

int main()
{

    return 0;
}