Skip to content

[Graph BFS/DFS] Clone Graph #125

@sudosf

Description

@sudosf

Problem

Given a reference to a node in a connected undirected graph, return a deep copy of the graph.

References

Difficulty

🟡 Medium

Companies

Amazon, Google, Goldman Sachs

Notes

Language: Java
BFS or DFS with a HashMap<originalNode, clonedNode> to track already-cloned nodes and avoid infinite loops.

Metadata

Metadata

Assignees

No one assigned

    Labels

    bfsBreadth-first searchdfsDepth-first searchgraphGraph problemsmediumMedium difficulty

    Projects

    Status
    Backlog

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions