Dequeue Linked List

Medium Queue: Linked List Implementation

Solve in Playground →

Problem Statement

Write a C program to enqueue elements into a linked list queue, perform dequeue operations, and print remaining elements from front to rear.

Input Format

First line contains n. Second line contains n elements to enqueue. Third line indicates number of dequeues to perform.

Output Format

Print the remaining queue elements from front to rear separated by spaces.

Constraints

1 <= n <= 50, dequeues < n

Sample Input

4
10 20 30 40
1

Sample Output

20 30 40

Explanation

Enqueue elements, remove the front node for the specified number of dequeues by updating front = front->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 enqueue, dequeue, and print linked list queue
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →