Clone Graph
Return a deep copy of a connected undirected graph.
Progress cannot be saved in this browser, so completed lessons will reset when you leave.
Lesson notes
Try it before you watch
Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.
Reveal the key idea
Traverse the graph with DFS or BFS while a dictionary maps every original node to its clone, which also prevents copying a node twice.
Pattern: Graphs. Model the problem as nodes and edges, then pick the traversal: DFS, BFS or a topological order.
Complexity
| Measure | Bound |
|---|---|
| Time | O(V + E) |
| Extra space | O(V) |
Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.