Circular Queue Implementation

Medium Queue: Advanced Types

Solve in Playground →

Problem Statement

Write a C program to implement a circular queue using a fixed-size array, perform enqueues and dequeues, and print remaining elements in proper order.

Input Format

First line: capacity. Second line: n operations (positive for enqueue, 0 for dequeue).

Output Format

Print elements from front to rear in the circular queue separated by spaces.

Constraints

1 <= capacity <= 50, 1 <= n <= 50

Sample Input

5
1 10 1 20 1 30 0 1 40

Sample Output

20 30 40

Explanation

Use modulo arithmetic `(rear + 1) % capacity` and `(front + 1) % capacity` to wrap indices around a fixed array buffer.

Starter Code

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

int main() {
    int cap;
    if (scanf("%d", &cap) == 1) {
        // Write your code here to implement circular queue operations
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →