Peek

Easy Stack: Array Implementation

Solve in Playground →

Problem Statement

Write a C program to push elements onto an array-based stack and print the top element using a peek operation without removing it.

Input Format

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

Output Format

Print the top element of the stack.

Constraints

1 <= n <= 50

Sample Input

4
10 20 30 40

Sample Output

Explanation

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

Starter Code

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

#define MAX 100

struct Stack {
    int arr[MAX];
    int top;
};

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

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →