Display Queue

Medium Circular Queue
Solve in Playground →

Problem Statement

Write a C program to display all elements of a circular queue from front to rear.

Input Format

First line: capacity and n. Second line: n elements.

Output Format

Print elements from front to rear separated by spaces.

Constraints

1 <= n <= capacity <= 50

Sample Input

5 4
10 20 30 40

Sample Output

10 20 30 40

Explanation

Iterate from 0 to size-1 using `(front + i) % capacity` to display queue items in correct FIFO order.

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

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used