Tap here to switch tabs
Problem
Submissions

Problem: Redundant Connection

Redundant Connection gives an undirected graph with one cycle and asks you to return the edge whose removal makes it a connected, cycle-free tree, choosing the last such edge listed.

Statement

We’re given an undirected graph consisting of nn nodes. The graph is represented as list called edges, of length nn, 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 nn nodes. If there are multiple candidates for removal, return the edge that occurs last in edges.

Constraints:

  • 3≤3 \leq nn ≤100\leq 100
  • edges.length== nn
  • edges[i].length == 2
  • 1≤1 \leq a << b ≤n\leq n
  • a≠ba \neq b
  • There are no repeated edges.
  • The given graph is connected.
  • The graph contains only one cycle.
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Redundant Connection

Redundant Connection gives an undirected graph with one cycle and asks you to return the edge whose removal makes it a connected, cycle-free tree, choosing the last such edge listed.

Statement

We’re given an undirected graph consisting of nn nodes. The graph is represented as list called edges, of length nn, 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 nn nodes. If there are multiple candidates for removal, return the edge that occurs last in edges.

Constraints:

  • 3≤3 \leq nn ≤100\leq 100
  • edges.length== nn
  • edges[i].length == 2
  • 1≤1 \leq a << b ≤n\leq n
  • a≠ba \neq b
  • There are no repeated edges.
  • The given graph is connected.
  • The graph contains only one cycle.