859. Critical Connections in a Network
Hard•
A connected undirected network has n servers labeled 0 through n - 1. Each pair [u, v] in connections is a bidirectional connection.
Return every connection whose removal would split the network into disconnected groups. Return edges in any order, and either endpoint order is accepted. There are no self-loops or repeated edges.
Example 1:
Input: n = 4, connections = [[0,1],[1,2],[2,0],[1,3]]
Output: [[1,3]]
Explanation: Removing 1--3 isolates server 3. Removing an edge of the triangle still leaves a route between its endpoints.
Example 2:
Input: n = 2, connections = [[0,1]]
Output: [[0,1]]
Explanation: The only connection is necessary to keep the two servers connected.
Constraints
- 2 <= n <= 100000
- n - 1 <= connections.length <= 100000
- 0 <= u, v < n; u != v
- The network is connected and has no repeated undirected edges
Accepted1/1|Acceptance Rate100.0%