11. Merge Two Sorted Lists

Easy

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: list1 = [1, 2, 4], list2 = [1, 3, 4]

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

Explanation: The two lists are merged in sorted order.

Example 2:

Input: list1 = [], list2 = []

Output: []

Explanation: Both lists are empty, so the merged list is also empty.

Example 3:

Input: list1 = [], list2 = [0]

Output: [0]

Explanation: Only list2 has a node, so the merged list contains only that node.

Constraints:

•
•
•

Time Complexity

O(n+m)

Space Complexity

O(1)

11. Merge Two Sorted Lists

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

11. Merge Two Sorted Lists

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases