DSA Level 2 Data Structures Linked List Merge Two Sorted Linkedlist

Merge Two Sorted Linkedlist

easy

Question Solve Solutions

1. Merge two sorted linkedlists and return head of a sorted linkedlist. The list should be made by splicing together the nodes of the first two lists
2. Both list are sorted in increasing order.

Input Format

1->2->6->7->15->24->null -1->0->6->17->25->null

Output Format

-1->0->1->2->6->6->7->15->17->24->25->null

Constraints

0 &lt;= size of linkedlist &lt;= 10^6

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

1 1 3 5 6 10

Unfold Of Linkedlist

Mergesort Linkedlist

Related Questions

easy Reverse A Linkedlist easy Middle Of A Linked List easy Palindrome Linkedlist easy Fold Of Linkedlist easy Unfold Of Linkedlist easy Mergesort Linkedlist easy Segregate Even And Odd Nodes In A Linkedlist easy Remove Nth Node From End Of Linkedlist easy Merge K Sorted Linkedlist easy Reverse Node Of Linkedlist In K Group easy Reverse In Range easy Copy Linkedlist With Random Pointers easy Is Cycle Present In Linkedlist easy Add Two Linkedlist medium Subtract Two Linkedlist easy Multiply Two Linkedlist