Get Front

Easy Deque PRO

🔒 Login to Unlock

Problem Statement

Write a C program to insert elements into a deque and retrieve the front element using a peek operation.

Input Format

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

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 deque 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 get front element of deque
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock