Redundant Connection · Coding Interview Practice

Redundant ConnectionA tree of n nodes labelled 1 to n had one extra edge added between two of its nodes. Given the resulting n undirected edges, return an edge that can be removed so the remaining edges form a tree of n nodes. If there are several answers, return the one that appears last in the input.Constraints

n == edges.length

3 <= n <= 1000

edges[i].length == 2

1 <= a < b <= n

There are no repeated edges

The given graph is connected

Examples

Input: edges = [[1,2],[1,3],[2,3]] Output: [2,3]

Input: edges = [[1,2],[2,3],[3,4],[1,4],[1,5]] Output: [1,4]

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…