107. Merge K Sorted Lists

PRO

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

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

Explanation: The linked lists [1->4->5], [1->3->4], and [2->6] are merged into the sorted linked list 1->1->2->3->4->4->5->6.

Example 2:

Input: lists = []

Output: null

Explanation: An empty list of lists results in an empty merged list.

Example 3:

Input: lists = [[]]

Output: null

Explanation: A list containing only an empty list results in an empty merged list.

Constraints:

•
•
•
•
•
•

Time Complexity

O(N log k)

Space Complexity

O(k)

107. Merge K Sorted Lists

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

107. Merge K Sorted Lists

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases