Redundant Connection
Difficulty: Medium
Given a graph that started as a tree with one extra edge added, find and return the edge that can be removed to make it a tree again.
Difficulty: Medium
Given a graph that started as a tree with one extra edge added, find and return the edge that can be removed to make it a tree again.