Queue Rotation

Medium Circular Queue PRO

🔒 Login to Unlock

Problem Statement

Write a C program to rotate a circular queue elements by k positions efficiently.

Input Format

Capacity, n elements, and rotation count k.

Output Format

Print rotated circular queue elements separated by spaces.

Constraints

1 <= n <= capacity <= 50, 0 <= k <= 50

Sample Input

5 4 2
10 20 30 40

Sample Output

30 40 10 20

Explanation

Shift the front and rear index pointers logically by k positions within the circular capacity buffer.

Starter Code

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

int main() {
    int cap, n, k;
    if (scanf("%d %d %d", &cap, &n, &k) == 3) {
        // Write your code here to rotate circular queue
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock