Merge Two Sorted Lists | Dataford Interview Questions

Merge two sorted linked lists in O(N) time.

Asked in the Onsite Round 1 stage.

Input and Output

Implement merge_two_lists(list1, list2), where each argument is the head of a singly linked list sorted in nondecreasing order. Return the head of one merged sorted linked list by reusing the existing nodes. In examples and tests, linked lists are represented as arrays of node values.

Constraints

Each list contains 0 to 10^5 nodes.
Node values are integers.
Both input lists are sorted in nondecreasing order.
The merged list must reuse the existing nodes.

Function Signature

def merge_two_lists(list1, list2):

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