Help me in solving QUEUE11 problem

help
,
1

My issue

Why did we use % maxSize in line no 25 and 36 instead of just rear++ or front++

My code

class CircularQueue {
    private static final int maxSize = 101;
    private int[] a = new int[maxSize];
    private int front = 0; // Index of the front element
    private int rear = -1;  // Index of the rear element
    private int currentSize;

    public boolean isEmpty() {
        return currentSize == 0;
    }

    public boolean isFull() {
        return currentSize == maxSize;
    }

    public int size() {
        return currentSize;
    }

    public void enqueue(int item) {
        if (isFull()) {
            System.out.println("Queue is full. Cannot enqueue.");
            return;
        }
        rear = (rear + 1) % maxSize; // Circular increment
        a[rear] = item;
        currentSize++;
    }

    public int dequeue() {
        if (isEmpty()) {
            System.out.println("Queue is empty. Cannot dequeue.");
            return -1; // Return a sentinel value or throw an exception
        }
        int removedItem = a[front];
        front = (front + 1) % maxSize; // Circular increment
        currentSize--;
        return removedItem;
    }

Learning course: Stacks and Queues
Problem Link: Enqueue and Dequeue Functions Practice Problem in Stacks and Queues - CodeChef

2

@achauhan8785
to take remainder , like if front or rear reaches the end it has to be within the range of 0 to maxSize . Thus u have to take % .

3

Okay, means if it exceeds maxSize then will it again point to first element right ?

4

yeah