← Questions
Copy list with random pointer
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Each node of a singly linked list has a next pointer and a random pointer that may point to any node in the list or to nothing. Return a deep copy of the list in which no pointer refers to an original node. Do it first with a map from old nodes to new ones, then discuss the version that interleaves copies into the original list to use constant extra space.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding


