51. 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]] (represented as linked lists)

Output: [1,1,2,3,4,4,5,6] (represented as a linked list)

Explanation: The three sorted lists are merged into a single sorted list.

Example 2:

Input: lists = []

Output: []

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

Example 3:

Input: lists = [[]]

Output: []

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

Constraints:

•
•
•
•
•
•

Time Complexity

O(N log k)

Space Complexity

O(k)

51. 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

51. 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