23. Merge k Sorted Lists
HardLinked List
You are given an array of k linked-lists, each sorted in ascending order. Merge all lists into one sorted list. Lists are given as arrays.
Examples
Input: [[1,4,5],[1,3,4],[2,6]]
Output: [1,1,2,3,4,4,5,6]
Explanation: Public test case for Merge k Sorted Lists
Constraints
- k == lists.length
- 0 <= k <= 10^4
Loading...
Run checks all cases above. Submit evaluates all test cases.