Merge K Sorted Lists
Try to solve the Merge K Sorted Lists problem.
We'll cover the following
Statement
Given an array of sorted linked lists, your task is to merge them into a single sorted linked list and return the head of this linked list.
Constraints:
-
lists.length
-
lists[i].length
-
lists[i][j]
- Each
lists[i]
is sorted in ascending order. - The sum of all
lists[i].length
will not exceed .
Example
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy