Skip to main content

Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.

Problems22 / 152
Sign in

Merge Two Sorted Lists

EASYLinked ListRecursion

You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged 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 = []
Output: []
Show hint

Use a dummy node to simplify. Compare nodes from both lists, attach the smaller one, and move the pointer forward.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
list1 =
[1,2,4]
list2 =
[1,3,4]
Expected
[1,1,2,3,4,4]
Run with your own input (JSON)