Practice Merge k Sorted Lists
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Hard#23
LeetCode ProblemMerge k Sorted Lists
Problem Statement
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.
Source: Merge k Sorted Lists on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
lists = [[1,4,5],[1,3,4],[2,6]]
Output
[1,1,2,3,4,4,5,6]
# Example 2
Input
lists = []
Output
[]
# Example 3
Input
lists = [[]]
Output
[]
Constraints
k == lists.length
0 <= k <= 10^4
0 <= lists[i].length <= 500
-10^4 <= lists[i][j] <= 10^4
lists[i] is sorted in ascending order.
The sum of lists[i].length will not exceed 10^4.
Related LeetCode Problems
Practice more problems similar to Merge k Sorted Lists.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.