LeetCode Top Interview 150 · Linked List Merge (K-Way)
Merge two or more already-sorted linked lists into one sorted list by repeatedly picking the smallest head.
Sheet Problems: 2
Category: Linked List
ℹ
Curated selection from LeetCode Top Interview 150
This sheet features 2 problems testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Linked List Merge (K-Way) Pattern Guide.
Featured Problems (2)
Explore More Patterns in LeetCode Top Interview 150
Track your progress across all 150 problems in this curriculum roadmap.