solution.cpp

// 622. Design Circular Queue
// https://leetcode.com/problems/design-circular-queue/
// Medium | C++ | Accepted on NeetCode 2026-09-04

class MyCircularQueue {
public:
vector<int> q;
int head;
int tail;
int size;
int capacity;
    MyCircularQueue(int k) {
        q.resize(k);
        head = 0;
        tail = -1;
        size = 0;
        capacity = k;
    }
    
    bool enQueue(int value) {
        if(isFull())
        {
            return false;
        }
        tail = (tail+1)%capacity;
        q[tail] = value;
        size++;
        return true;
    }
    
    bool deQueue() {
        if(isEmpty())
        {
            return false;
        }
        head = (head+1)%capacity;
        size--;
        return true;
    }
    
    int Front() {
        if(isEmpty())
        {
            return -1;
        }
        return q[head];
    }
    
    int Rear() {
        if(isEmpty())
        {
            return -1;
        }
        return q[tail];
    }
    
    bool isEmpty() {
        return size == 0 ? true : false;
    }
    
    bool isFull() {
        return size == capacity ? true : false;
    }
};

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