Loading compiler resources...
Given a reference of a node in a connected undirected graph, return a deep clone of the graph.
Each node in the graph contains a value (val) and a list of its neighbors (neighbors).
// Node structure:
// { val: number, neighbors: Node[] }Run your code to see results.
This interactive challenge requires a DeepFrontend Pro membership. Get instant access to write, execute, test, and view verified solution code directly in your browser.
Regional pricing available • Instant access
Stuck? This challenge exercises: