Skip to content
BASA DSA

Merge Two Sorted Lists

EasyLinked List

Merge two nondecreasing singly linked lists and return the head of a nondecreasing list containing every node value.

Example 1

Argument 1: next pointers; tail points to null.Argument 1: next pointers; tail points to null. Vertices: node 0: 1, node 1: 4, node 2: 4. Edges: node 0 (1) → node 1 (4); node 1 (4) → node 2 (4).144
Argument 1: next pointers; tail points to null.

Argument 2: next pointers; tail points to null.Argument 2: next pointers; tail points to null. Vertices: node 0: 2, node 1: 3. Edges: node 0 (2) → node 1 (3).23
Argument 2: next pointers; tail points to null.

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

Explanation

Merge both streams while retaining both occurrences of 4.

Example 2

Argument 1: next pointers; tail points to null. No nodes or connections.
Argument 2: next pointers; tail points to null.Argument 2: next pointers; tail points to null. Vertices: node 0: 8. Edges: none.8
Argument 2: next pointers; tail points to null.

Input
list1 = []
list2 = [8]
Output
[8]

Explanation

The first list is empty, so the second list supplies the sole node 8.

Example 3

Argument 1: next pointers; tail points to null. No nodes or connections.
Argument 2: next pointers; tail points to null. No nodes or connections.
Input
list1 = []
list2 = []
Output
null

Explanation

Two empty lists merge into an empty list.

Constraints

  • 0 <= total nodes <= 10000
  • Inputs are acyclic lists encoded as value arrays

Function contractmergeTwoListsArguments: list, list
Loading draft…
SolutionRuns on your device