Pop Linked List

Medium Stack: Linked List Implementation

Solve in Playground →

Problem Statement

Write a C program to push elements onto a linked list stack, perform a pop operation, and print the remaining elements from top to bottom.

Input Format

First line contains n. Second line contains n elements to push. Third line indicates number of pops to perform.

Output Format

Print the remaining stack elements from top to bottom separated by spaces.

Constraints

1 <= n <= 50, pops < n

Sample Input

4
10 20 30 40
1

Sample Output

30 20 10

Explanation

Push elements, remove the top node for the specified number of pops by updating top = top->next and freeing memory.

Starter Code

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

struct Node {
    int data;
    struct Node *next;
};

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to push, pop, and print linked list stack
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →