Merge Two Sorted Linkedlist
easy
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.
Constraints
0 <= size of linkedlist <= 10^6
Format
Input
1->2->6->7->15->24->null -1->0->6->17->25->null
Output
-1->0->1->2->6->6->7->15->17->24->25->null
Example
Sample Input
2
1 5
4
1 3 6 10
Sample Output
1 1 3 5 6 10