Round one :
You are given two linked lists and two integers i and j (i <= j). You need to replace the nodes from index i to j (0-based) in the first linked list with the entire second linked list and return the updated list.
Example:
Input:
List1: 1 -> 2 -> 3 -> 4 -> 9 -> 6
List2: 4 -> 5 -> 10 -> 7 -> 3
i = 2, j = 4
Output:
1 -> 2 -> 4 -> 5 -> 10 -> 7 -> 3 -> 9 -> 6
Other Question Java ( Immutability etc) , Spring boot ( DI , Scope , Bean ) Singleton pattern, Rest API (What happen if we call POST but in apps we defined put method)