Merge Linked Lists | Dataford Interview Questions

How would you merge two linked lists, both recursively and iteratively? Follow up: how would you merge n linked lists?

Treat each inner input list as the values of one sorted singly linked list. Implement both two-list approaches and use an iterative pairwise strategy for the n-list function. The function receives lists as list[list[int]] and returns the merged values as a sorted list[int].

Function signature: def merge_sorted_lists(lists):

Constraints

0 <= len(lists) <= 10^4
0 <= len(lists[i]) <= 10^4
Each inner list is sorted in nondecreasing order
The total number of values across all lists is at most 10^5
-10^9 <= lists[i][j] <= 10^9

Function Signature

def merge_sorted_lists(lists):

Your question is Merge Linked 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

How would you merge two linked lists, both recursively and iteratively? Follow up: how would you merge n linked lists?

Function signature: def merge_sorted_lists(lists):

Constraints

0 <= len(lists) <= 10^4
0 <= len(lists[i]) <= 10^4
Each inner list is sorted in nondecreasing order
The total number of values across all lists is at most 10^5
-10^9 <= lists[i][j] <= 10^9

Function Signature

def merge_sorted_lists(lists):

Your question is Merge Linked 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.