**LeetCode Problem | LeetCode Problems For Beginners | LeetCode Problems & Solutions | Improve Problem Solving Skills | LeetCode Problems Java | LeetCode Solutions in C++**

Hello **Programmers/Coders,** Today we are going to share ** solutions to the Programming problems of LeetCode Solutions in C++, Java, & Python**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get a score or marks and LeetCode Coins. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for the **Copy List with Random Pointer** **in C++, Java & Python-LeetCode problem**. We are providing the **correct and tested solutions** to coding problems present on **LeetCode**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**About LeetCode**

*LeetCode* is one of the most well-known online judge platforms to help you enhance your skills, expand your knowledge and prepare for technical interviews.

LeetCode is for **software engineers who are looking to practice technical questions and advance their skills**. Mastering the questions in each level on LeetCode is a good way to prepare for technical interviews and keep your skills sharp. They also have a repository of solutions with the reasoning behind each step.

LeetCode has over 1,900 questions for you to practice, covering many different programming concepts. Every coding problem has a classification of either *Easy*, *Medium*, or *Hard*.

**LeetCode problems focus on algorithms and data structures. Here is some topic you can find problems on LeetCode:**

- Mathematics/Basic Logical Based Questions
- Arrays
- Strings
- Hash Table
- Dynamic Programming
- Stack & Queue
- Trees & Graphs
- Greedy Algorithms
- Breadth-First Search
- Depth-First Search
- Sorting & Searching
- BST (Binary Search Tree)
- Database
- Linked List
- Recursion, etc.

Leetcode has a huge number of test cases and questions from interviews too like Google, Amazon, Microsoft, Facebook, Adobe, Oracle, Linkedin, Goldman Sachs, etc. LeetCode helps you in getting a job in Top MNCs. To crack FAANG Companies, LeetCode problems can help you in building your logic.

** Link for the Problem** – Copy List with Random Pointer– LeetCode Problem

**Copy List with Random Pointer– LeetCode Problem**

**Problem:**

A linked list of length `n`

is given such that each node contains an additional random pointer, which could point to any node in the list, or `null`

.

Construct a **deep copy** of the list. The deep copy should consist of exactly `n`

**brand new** nodes, where each new node has its value set to the value of its corresponding original node. Both the `next`

and `random`

pointer of the new nodes should point to new nodes in the copied list such that the pointers in the original list and copied list represent the same list state. **None of the pointers in the new list should point to nodes in the original list**.

For example, if there are two nodes `X`

and `Y`

in the original list, where `X.random --> Y`

, then for the corresponding two nodes `x`

and `y`

in the copied list, `x.random --> y`

.

Return *the head of the copied linked list*.

The linked list is represented in the input/output as a list of `n`

nodes. Each node is represented as a pair of `[val, random_index]`

where:

`val`

: an integer representing`Node.val`

`random_index`

: the index of the node (range from`0`

to`n-1`

) that the`random`

pointer points to, or`null`

if it does not point to any node.

Your code will **only** be given the `head`

of the original linked list.

**Example 1:**

Input:head = [[7,null],[13,0],[11,4],[10,2],[1,0]]Output:[[7,null],[13,0],[11,4],[10,2],[1,0]]

**Example 2:**

Input:head = [[1,1],[2,1]]Output:[[1,1],[2,1]]

**Example 3:**

Input:head = [[3,null],[3,0],[3,null]]Output:[[3,null],[3,0],[3,null]]

**Constraints:**

`0 <= n <= 1000`

`-10`

^{4}<= Node.val <= 10^{4}`Node.random`

is`null`

or is pointing to some node in the linked list.

Copy List with Random Pointer– LeetCode Solutions

Copy List with Random Pointer Solution in C++:

class Solution { public: Node* copyRandomList(Node* head) { if (!head) return nullptr; if (map.count(head)) return map[head]; Node* newNode = new Node(head->val); map[head] = newNode; newNode->next = copyRandomList(head->next); newNode->random = copyRandomList(head->random); return newNode; } private: unordered_mapmap; };

Copy List with Random Pointer Solution in Java:

class Solution { public Node copyRandomList(Node head) { if (head == null) return null; if (map.containsKey(head)) return map.get(head); Node newNode = new Node(head.val); map.put(head, newNode); newNode.next = copyRandomList(head.next); newNode.random = copyRandomList(head.random); return newNode; } private Mapmap = new HashMap<>(); }

Copy List with Random Pointer Solution in Python:

class Solution: def copyRandomList(self, head: 'Node') -> 'Node': if head is None: return None if head in self.dict: return self.dict[head] self.dict[head] = Node(head.val) self.dict[head].next = self.copyRandomList(head.next) self.dict[head].random = self.copyRandomList(head.random) return self.dict[head] dict = {}