Yesterday, I solved a hard graph problem, feels good.
The problem: You are given an undirected, unweighted, connected graph G, where each node is identified by an integer from 0 to V - 1. You are also given a list, attached_pairs, of k pairs of nodes. We say an edge is indelible if removing it from G disconnects the two nodes in an attached pair. Return the list of the indelible edges.
Linear-time solution below.
