Back to course home

0% completed

# Solution: Merge K Sorted Lists

## Problem Statement

Given an array of ‘K’ sorted LinkedLists, merge them into one sorted list.

**Example 1**:

```
Input: L1=[2, 6, 8], L2=[3, 6, 7], L3=[1, 3, 4]
Output: [1, 2, 3, 3, 4, 6, 6, 7, 8]
```

**Example 2**:

```
Input: L1=[5, 8, 9], L2=[1, 7]
Output: [1, 5, 7, 8, 9]
```

**Constraints:**

`k == lists.length`

- 0 <= k <= 10<sup>4</sup>
`0 <= lists[i].length <= 500`

- -10<sup>4</sup> <= lists[i][j] <= 10<sup>4</sup>
`lists[i]`

is sorted in ascending order.- The sum of
`lists[i].length`

will not exceed 10<sup>4</sup>.

.....

.....

.....

Like the course? Get enrolled and start learning!