📝 New Problem Idea
Problem Title:
Clone a Graph
Brief Statement:
Given a reference of a node in a connected undirected graph.
Return a deep copy(clone) of the graph.
Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors.
class Node {
public int val;
public List neighbors;
}
Topic of this Problem
graph traversal bfs & dfs , hashmap
📝 New Problem Idea
Problem Title:
Clone a Graph
Brief Statement:
Given a reference of a node in a connected undirected graph.
Return a deep copy(clone) of the graph.
Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors.
class Node {
public int val;
public List neighbors;
}
Topic of this
Problemgraph traversal bfs & dfs , hashmap