Front / Peek

Easy Queue: Array Implementation

Solve in Playground →

Problem Statement

Write a C program to enqueue elements into an array-based queue and print the front element using a peek operation without removing it.

Input Format

First line contains n. Second line contains n elements to enqueue.

Output Format

Print the front element of the queue.

Constraints

1 <= n <= 50

Sample Input

4
10 20 30 40

Sample Output

Explanation

Verify that the queue is not empty and return `arr[front]` without modifying the front pointer.

Starter Code

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

#define MAX 100

struct Queue {
    int arr[MAX];
    int front;
    int rear;
};

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to enqueue elements and peek front
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →