🔥 Clone Graph

Author: maddhruv

README.md

@@ -23,3 +23,4 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 | [Reverse Bits]()                                                                  |                                                           |                                                    | [:link:](https://leetcode.com/problems/reverse-bits/)                         |
 | [Climbing Stairs](./climbing-stairs.js)                                           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Math`, `Dynamic Programming`, `Memoization`       | [:link:](https://leetcode.com/problems/climbing-stairs/)                      |
 | [Word Search](./word-search.js)                                                   | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Backtracking`, `Matrix`                  | [:link:](https://leetcode.com/problems/word-search/)                          |
+| [Clone Graph](./clone-graph.js)                                                   | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Graph`, `HashTable`, `DFS`, `BFS`                 | [:link:](https://leetcode.com/problems/clone-graph/)                          |

clone-graph.js

@@ -0,0 +1,16 @@
+const cloneGraph = (node) => {
+  const map = {};
+
+  const traverse = (n) => {
+    if (!n) return n;
+
+    if (!map[n.val]) {
+      map[n.val] = new Node(n.val);
+      map[n.val].neighbors = n.neighbors.map(traverse);
+    }
+
+    return map[n.val];
+  };
+
+  return traverse(node);
+};