Grokking the Coding Interview Patterns in C++/

...

/

Solution: Merge K Sorted Lists

Solution: Merge K Sorted Lists

Let's solve the Merge K Sorted Lists problem with the K-way Merge pattern.

We'll cover the following...

Statement

You are given an array, lists, containing k singly linked lists. Each of these linked lists is individually sorted in ascending order.

Your task is to merge all k linked lists into a single sorted linked list in ascending order and return the merged list.

Constraints:

  • k ==== lists.length

  • 0≤0 \leq k ≤103\leq 10^3

  • 0≤0 \leq lists[i].length ≤500 ...