Merge K Sorted Linked Lists
Merge K sorted linked lists.
Input: lists = [[2,2,3],[1,5]]
Output: [1,2,2,3,5]
Explanation: Extracts the smallest current node iteratively using a priority queue to build a single merged and sorted linked list.

Question

Merge K sorted linked lists.

Input: lists = [[2,2,3],[1,5]]

Output: [1,2,2,3,5]

Explanation: Extracts the smallest current node iteratively using a priority queue to build a single merged and sorted linked list.