Two-edge-connected components
Given an undirected graph with n nodes (0..n-1) and edges [u, v], a 2-edge-connected component is a maximal set of nodes that stays connected after the removal of any single edge. Equivalently, delete all bridges and count the resulting connected components. Return that count. Parallel edges may appear. Constraints: 1 <= n <= 2000.
Implement
count_2edge_components(n: int, edges: list[list[int]]) → intExamples
in
[4,[[0,1],[1,2],[2,3]]]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 40 min
solution.py
InputExpectedGot
[4,[[0,1],[1,2],[2,3]]]4not run yetsample