Merge K Sorted Lists | Dataford Interview Questions

Merge k Sorted Lists

Asked in the Coding stage. LeetCode 23.

Task

Implement merge_k_lists(lists). Each input list is sorted in nondecreasing order. Return one sorted list containing every value from every input list. Lists are represented as Python arrays for grading; an empty list represents an empty linked list.

Constraints

0 <= len(lists) <= 100
The total number of values across all lists is at most 500
Each input list is sorted in nondecreasing order
Values are integers

Function Signature

def merge_k_lists(lists):

Your question is Merge K Sorted Lists. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem