Redundant Connection
Try to solve the Redundant Connection problem.
We'll cover the following...
Statement
We’re given an undirected graph consisting of nodes. The graph is represented as list called edges
, of length , where edges[i] = [a, b]
indicates that there is an edge between nodes a
and b
in the graph.
Return an edge that can be removed to make the graph a