[Code Addition Request]: I would like to add linked list algorithm, clone linked list with random connection

[SKG24]

Have you completed your first issue?

• [X] I have completed my first issue

Guidelines

• [X] I have read the guidelines
• [X] I have the link to my latest merged PR

Latest Merged PR Link

This is my first issue

Project Description

Given a linked list where each node has a next pointer to the next node in the list and a random pointer that can point to any node in the list (or be NULL), create a deep copy (clone) of the list. The cloned list should have nodes with the same values and maintain the same next and random pointers structure as the original list.

Explanation of Solution

• We will use an unordered_map to store the mapping from each node in the original list to its corresponding node in the cloned list. This will help us efficiently set up the next and random pointers for the nodes in the copied list.

• Mapping Nodes: In the first traversal, we create a new node for each node in the original list and map it to the original node in the unordered_map.

• Setting Pointers: In the second traversal, we set the next and random pointers for each cloned node. Using the unordered_map, we can efficiently look up and set these pointers to ensure the cloned list has the same structure as the original.

• Returning the Cloned Head: Finally, we return the cloned node that corresponds to the original list’s head.

Full Name

Sanat Kumar Gupta (@skg24)

Participant Role

gssoc-ext, hackoctoberfest

[github-actions[bot]]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!

[SKG24]

Please assign this to me