Merge Lists

Hard Doubly Linked List: Advanced PRO

🔒 Login to Unlock

Problem Statement

Write a C program to merge two sorted doubly linked lists into a single sorted doubly linked list.

Input Format

First line: n1 and n2. Second line: n1 sorted elements. Third line: n2 sorted elements.

Output Format

Print the combined sorted doubly linked list separated by spaces.

Constraints

1 <= n1, n2 <= 50

Sample Input

3 3
1 3 5
2 4 6

Sample Output

1 2 3 4 5 6

Explanation

Iteratively compare heads of both sorted doubly linked lists, link nodes maintaining next and prev pointers, and produce a unified sorted list.

Starter Code

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

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

int main() {
    int n1, n2;
    if (scanf("%d %d", &n1, &n2) == 2) {
        // Write your code here to read two sorted doubly linked lists and merge them
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock