← Divide & Conquer

Micro-Drill #76 — Merge two sorted lists

Divide & Conquer Target: 15s

Merging sorted lists is the core of merge sort and merge-k-lists.

i = j = 0
merged = []
while i < len(a) and j < len(b):
    if a[i] <= b[j]:
        merged.append(a[i]); i += 1
    else:
        merged.append(b[j]); j += 1
merged.extend(a[i:])
merged.extend(b[j:])

Type it from memory. Go.

Practice Problems

• 21. Merge Two Sorted Lists
• 88. Merge Sorted Array

Related Coding Drills

• Drill #32 — Merge two sorted arrays Easy
• Drill #15 — Merge two sorted lists Easy
• Drill #6 — Merge two sorted arrays Easy