Merge K Sorted Lists

Category: Heap / Priority Queue

Difficulty: advanced

Description: Merge using min heap

Time Complexity: O(N log k)

Space Complexity: O(k)

Related LeetCode Problems

• 23. Merge k Sorted Lists (Hard)
• 21. Merge Two Sorted Lists (Easy)
• 373. Find K Pairs with Smallest Sums (Medium)
• 378. Kth Smallest Element in a Sorted Matrix (Medium)
• 218. The Skyline Problem (Hard)
• 1046. Last Stone Weight (Easy)
• 632. Smallest Range Covering Elements from K Lists (Hard)
• 264. Ugly Number II (Medium)
• 373. K Pairs with Smallest Sums (duplicate for heap merging) (Medium)
• 778. Swim in Rising Water (Hard)
• 23. Merge k Sorted Lists (repeat for clarity) (Hard)
• 373. Find K Pairs with Smallest Sums (Medium)
• 451. Sort Characters By Frequency (Medium)
• 692. Top K Frequent Words (Medium)