A linked list is given such that each node contains an additional random pointer which could point to any node in the list or
Return a deep copy of the list.
1 -> 2 -> 3
with random pointers going from
1 -> 3 2 -> 1 3 -> 1
You should return a deep copy of the list. The returned answer should not contain the same node as the original list, but a copy of them. The pointers in the returned list should not link to any node in the original input list.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.