Is Full

Easy Queue: Array Implementation

Solve in Playground →

Problem Statement

Write a C program to check whether a fixed-size array-based queue is full (print 1 if full, 0 otherwise).

Input Format

An integer representing the number of elements enqueued into the queue.

Output Format

Print 1 if rear == MAX - 1, else 0.

Constraints

0 <= elements <= MAX

Sample Input

Sample Output

Explanation

Compare the rear index with MAX - 1 to determine if maximum queue capacity has been reached.

Starter Code

#include <stdio.h>
#include <stdlib.h>

#define MAX 5

struct Queue {
    int arr[MAX];
    int front;
    int rear;
};

int main() {
    int count;
    if (scanf("%d", &count) == 1) {
        struct Queue q;
        q.front = 0;
        q.rear = -1;
        for (int i = 0; i < count && i < MAX; i++) {
            q.rear++;
            q.arr[q.rear] = i;
        }
        // Write your code here to check if queue is full
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →