You are given two singly linked lists list1 and list2, along with two integers a and b. Modify list1 in place by removing the contiguous segment of nodes from index a through index b inclusive, using $0$ based indexing. Then splice the entire linked list list2 into list1 at the position where that segment was removed.

Return the head of the updated linked list.

The method signature is ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2).

Constraints:

• $3 \leq$ list1.length $\leq 10^4$

• $1 \leq$ a $\leq$ b $<$ list1.length $- 1$

• $1 \leq$ list2.length $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.