Practice Challenge

Hard Singly Linked List: Advanced PRO

🔒 Login to Unlock

Problem Statement

Write a C program to remove every node which has a node with a greater value anywhere on its right side in the singly linked list.

Input Format

First line contains n. Second line contains n elements.

Output Format

Print the updated linked list separated by spaces.

Constraints

1 <= n <= 50

Sample Input

6
12 15 10 11 5 6

Sample Output

15 11 6

Explanation

Reverse the list, track the running maximum from the left, filter out smaller nodes, and reverse back.

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 for singly linked list practice challenge
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock