Merge Two Sorted Lists
Solution ApproachWas this helpful?
Easy•linked-list•Expected: O(n+m) time, O(1) space
sorting
Problem
Given the heads of two sorted linked lists, merge them into one sorted linked list.
Example 1:
Input: list1 = [1, 2, 4], list2 = [1, 3, 4]
Output: [1, 1, 2, 3, 4, 4]
Example 2:
Input: list1 = [], list2 = [0]
Output: [0]
Reference solution unlocks after your first submission
Loading...