Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Merge Two Sorted Lists · easy linked list interview problem · Larpy

easy· linked-list Mock interview

Merge Two Sorted Lists

Given the heads of two sorted-ascending singly linked lists, merge them into one sorted list and return its head.

Figure

node by position

Examples

in: l1 = [1,2,4], l2 = [1,3,4]

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

merged in order

in: l1 = [], l2 = [0]

out: [0]

one empty

Constraints

0 <= length of each list <= 50
-100 <= node value <= 100

Hints

target: O(n + m) time⌘↩ run · ⇧⌘↩ submit

More linked-list problems

Reverse a Linked Listeasy
Palindrome Linked Listeasy
Merge k Sorted Listshard
Reverse Nodes in k-Grouphard
Remove Nth Node From Endmedium
Add Two Numbersmedium