I had a telephonic interview. The interviewer asked me to write code for a deep copy of a linked list. I did, but I was not selected for the next rounds. Overall, the interviewer was helpful.

Deep copy of a linked list

This problem requires creating a deep copy of a linked list. A deep copy means that not only the nodes themselves are duplicated, but also any data structures they might point to are duplicated as well. For a linked list, this typically means copying the nodes and their 'next' pointers.

Consider a linked list where each node has two pointers:

• next: Points to the next node in the list.
• random: Points to any node in the list, or null.