Depth-First Search pattern

Copy Graph

Given a reference to a node in a connected undirected graph, return a deep copy of the entire graph, where each cloned node holds the same value and its own list of neighbor clones. Watch it run step by step, then write your own pseudocode and get it checked by AI.

  • LeetCode 133
  • Medium
  • 1 approach
Sign in to open it See plans

Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.

Depth-First SearchLeetCode 133

Medium

The approach

  1. 01 DFS with old→new hash map O(V + E)O(V) space
Played step by step, with its time and space.

What you will learn

  • How to read Copy Graph and spot the depth-first search pattern in it
  • DFS with old→new hash map: O(V + E) time, O(V) space
  • The pseudocode for each approach, its line lit as the animation runs
  • Practice: write your own pseudocode and get it checked

More Depth-First Search

See Copy Graph run, step by step

Sign in and this page opens on the animation, with all 18 Depth-First Search problems beside it.

Sign in to open itSee plans

DSA comes with the all labs plan and every ChaiCode batch.