Clone Graph · Coding Interview Practice

Clone GraphGiven a reference to a node in a connected undirected graph, return a deep copy of the graph.Constraints

The number of nodes is in the range [0, 100]

1 <= Node.val <= 100, values are unique

The graph is connected and has no self-loops

Examples

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

Input: adjList = [[]] Output: [[]]

LetsDiscuss

Loading your session…