Merge Two Sorted Lists

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

30:00

Merge Two Sorted Lists

easy

Topics

Companies

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

Example 1:

Input: {"list1":[1,2,4],"list2":[1,3,4]}

Output: [1,1,2,3,4,4]

Constraints:

The number of nodes in both lists is in the range $[0, 50]$ .
$-100 \leq \text{Node.val} \leq 100$
Both list1 and list2 are sorted in non-decreasing order.

Input

arr ={"list1":[1,2,4],"list2":[1,3,4]}

Init dummy and tail

tail ↓

0

NULL

l1 ↓

1

2

4

NULL

l2 ↓

1

3

4

NULL

Variables

No variables to display

DepthFunction Call

Stack empty

0/21