Clone Graph — Medium Coding Interview Question

Return a deep copy (clone) of a connected undirected graph. Each node contains a value and a list of its neighbors.

Example

Input: adjList = [[2,4],[1,3],[2,4],[1,3]]

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

Constraints

• 0 ≤ nodes ≤ 100
• Node.val is unique.

Topics & Companies

Topics: graphs, hash-map

Asked by: Amazon, Google, Meta, Microsoft, Apple, Adobe

Optimal Solution Complexity

Time complexity: O(V+E). Space complexity: O(V).

Practice more

• All DSA Problems
• DSA Patterns