Replace a Range of Nodes in a Linked List

You are given two singly linked lists, list1 and list2, and two 0-indexed indices i and j (0 <= i <= j). Remove every node in list1 from index i through index j, inclusive, and ins...