🌀 Day 20

Author: AkashRajpurohit

README.md

@@ -31,6 +31,7 @@
 3. [Repeated DNA Sequences](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3498/) ➡️ [CPP Solution](Week3/findRepeatedDnaSequences.cpp)
 4. [Best Time to Buy and Sell Stock IV](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3499/) ➡️ [CPP Solution](Week3/maxProfit.cpp)
 5. [Minimum Domino Rotations For Equal Row](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3500/) ➡️ [CPP Solution](Week3/minDominoRotations.cpp)
+6. [Clone Graph](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3501/) ➡️ [CPP Solution](Week3/cloneGraph.cpp)
 
 
 ## Week 4 🚧

Week3/cloneGraph.cpp

@@ -0,0 +1,47 @@
+/*
+// Definition for a Node.
+class Node {
+public:
+    int val;
+    vector<Node*> neighbors;
+    
+    Node() {
+        val = 0;
+        neighbors = vector<Node*>();
+    }
+    
+    Node(int _val) {
+        val = _val;
+        neighbors = vector<Node*>();
+    }
+    
+    Node(int _val, vector<Node*> _neighbors) {
+        val = _val;
+        neighbors = _neighbors;
+    }
+};
+*/
+
+class Solution {
+private:
+    Node* cloneGraph(Node* node, unordered_map<Node*, Node*>& m) {
+        if(node == NULL) 
+            return NULL;
+        
+        if(m.find(node) != m.end()) 
+            return m[node];
+        
+        Node* root = new Node(node->val);
+        m[node] = root;
+        
+        for(Node* ng: node->neighbors)
+            root->neighbors.push_back(cloneGraph(ng, m));
+        
+        return root;
+    }
+public:
+    Node* cloneGraph(Node* node) {
+        unordered_map<Node*, Node*> m;
+        return cloneGraph(node, m);
+    }
+};