Clone an Undirected Graph

Problem

Return a deep copy of a graph expressed as an adjacency list (each index represents a node).

Examples

Example 1

Input: [[1,3],[0,2],[1,3],[0,2]]

Output: [[1,3],[0,2],[1,3],[0,2]]

Example 2

Input: [[],[]]

Output: [[],[]]

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Clone an Undirected Graph

Return a deep copy of a graph expressed as an adjacency list (each index represents a node). Map every original node to a newly allocated cloned node. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(V+E) time and space.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.