Dynamic Circular Queue

Hard Circular Queue PRO

🔒 Login to Unlock

Problem Statement

Write a C program to implement a dynamic circular queue that automatically resizes (doubles capacity) when full.

Input Format

Initial capacity and n elements to enqueue.

Output Format

Print final capacity and elements after resizing.

Constraints

1 <= n <= 50

Sample Input

2 4
10 20 30 40

Sample Output

Capacity: 4, Elements: 10 20 30 40

Explanation

When size reaches capacity, reallocate a larger array and copy existing elements sequentially from front to rear.

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 dynamic circular queue resizing
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock