Back
hard Linked Lists 60 points

Merge K Sorted Lists

You are given an array of k sorted linked lists. Merge them into one sorted linked list and return it.

Problem Description

You are given an array of k sorted linked lists. Merge them into one sorted linked list and return it.

Examples

Example

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

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

Challenge Info

60 Points

Reward

hard

Difficulty

No limit

Time Limit

Submission Stats

Total Submissions 0
Accepted 19
Success Rate 0%