Practice Challenge

Hard Circular Queue PRO

🔒 Login to Unlock

Problem Statement

Write a C program to reverse the order of elements in a circular queue using an auxiliary array.

Input Format

Capacity and n elements.

Output Format

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

Constraints

1 <= n <= capacity <= 50

Sample Input

5 4
10 20 30 40

Sample Output

40 30 20 10

Explanation

Extract elements into a linear array, reverse the linear array, and reconstruct the circular queue buffer.

Starter Code

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

int main() {
    int cap, n;
    if (scanf("%d %d", &cap, &n) == 2) {
        // Write your code here for circular queue practice challenge
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock