Min Stack

Hard Stack: Advanced Applications PRO

🔒 Login to Unlock

Problem Statement

Write a C program to design a stack that supports push, pop, top, and retrieving the minimum element in constant time O(1).

Input Format

First line contains n operations count. Subsequent lines contain operations (1 val for push, 2 for pop, 3 for getMin).

Output Format

Print the result of getMin or top operations when requested.

Constraints

1 <= n <= 100

Sample Input

Sample Output

2
3

Explanation

Maintain an auxiliary stack alongside the primary stack to track minimum elements at each corresponding stack level in O(1) time.

Starter Code

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

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to implement Min Stack operations
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock