Merge k Sorted Lists · Coding Interview Practice

Merge k Sorted ListsGiven an array of k sorted linked lists, merge them into one sorted linked list and return it.Constraints

k == lists.length, 0 <= k <= 10^4

0 <= lists[i].length <= 500

-10^4 <= Node.val <= 10^4

Examples

Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6]

Input: lists = [] Output: []

LetsDiscuss

Loading your session…