Skip to main content
Clone Graph
mediumBlind 75

Clone Graph

Clone Graph is the canonical visited-map problem: as you DFS, a map from old node to new node both stops infinite loops and wires up the copied edges. Skip the map and a cycle sends you spinning forever. Once you see why one structure does double duty, most graph-copy problems collapse into it.

GraphsBFS / DFS

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1Clone Graphmedium
Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.