Copy List with Random Pointer - Leetcode 138 - Linked Lists (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@christianjt7018]

I was able to solve this one by myself but I like your solution a lot more, thanks for sharing!

[@GregHogg]

That's awesome!

[@TheResponsibleDude]

Was able to do this in O(1) space complexity by pointing original node's next to new node. And we can go back and forth

[@RakeshPandrinki-k6l]

this is brilliant solution

[@GarouNguyen]

why return old_to_new[head] hash map not the new_node you just create?

[@omkarwalunj6720]

old_to_new[head] will return the value of HashMap which points to the head of new list, as we are mapping original list to the new (copied) list in first pass and then creating the new link list in second pass, so when we return old_to_new[head] it will give head of the new list

[@shreehari2589]

Please do clone graph next

[@GregHogg]

Sorry for the slow reply but hopefully you saw I did do that problem or you figured it out before that haha

[@shreehari2589]

@@GregHogg yes watched it, thank you 😊

[@GregHogg]

@@shreehari2589 Amazing

[@ThoXuanLe]

Nice

[@yingxie9974]

Very V