Enqueue

Medium Circular Queue

Solve in Playground →

Problem Statement

Write a C program to enqueue elements into a circular queue using modulo arithmetic and print the queue elements from front to rear.

Input Format

First line contains capacity and n. Second line contains n elements to enqueue.

Output Format

Print elements of the circular queue separated by spaces.

Constraints

1 <= n <= capacity <= 50

Sample Input

5 4
10 20 30 40

Sample Output

10 20 30 40

Explanation

Update rear as `(rear + 1) % capacity`, insert the value, and increment size.

Starter Code

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

int main() {
    int cap, n;
    if (scanf("%d %d", &cap, &n) == 2) {
        // Write your code here to enqueue elements in circular queue
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →