Merge k Sorted Lists

#23
Hard
Heap / Priority Queue
O(n log k)
O(k)
Amazon
Facebook
Microsoft
Google
View on LeetCode

Problem Description

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.