Merge In Between Linked Lists | Dataford Interview Questions

Merge in Between Linked Lists (LeetCode-style linked-list coding question)

Asked in the Round 1 (online HackerRank assessment) stage.

Given the heads of two singly linked lists, integers a and b, remove nodes at positions a through b from list1, then insert all nodes from list2 in their place. Return the head of the modified linked list.

The function receives ListNode objects. In the examples and tests, linked lists are represented as arrays for serialization.

Function

merge_in_between(list1, a, b, list2)

Constraints

1 <= len(list1) <= 1000
1 <= len(list2) <= 1000
0 <= a <= b < len(list1)
All node values fit within the standard integer range
The input lists are singly linked and list2 is non-empty

Function Signature

def merge_in_between(list1, a, b, list2):

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