Peek Front

Easy Circular Queue

Solve in Playground →

Problem Statement

Write a C program to enqueue elements into a circular queue and peek at the front element without removing it.

Input Format

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

Output Format

Print the front element.

Constraints

1 <= n <= capacity <= 50

Sample Input

5 3
10 20 30

Sample Output

Explanation

Return `arr[front]` if the queue is not empty.

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 peek front of circular queue
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →