Solution: Redundant Connection

Statement

We’re given an undirected graph consisting of $n$ nodes. The graph is represented as an array called edges, of length $n$, 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 treeA tree is an undirected graph that is connected and has no cycles. of $n$ nodes. If there are multiple candidates for removal, return the edge that occurs last in edges.

Constraints:

• $3 \leq$ $n$ $\leq 100$
• edges.length$=$