Fewest edge moves to connect a graph
An undirected graph has n nodes and a list of edges. One move detaches an existing edge and reattaches it between any two distinct nodes. Return the fewest moves needed to make the graph connected, or report that it is impossible.
AmazonCodingNo answer yet. Write the first one; the best answer gets endorsed.