Count bridges
An undirected connected-or-not graph on n nodes (0..n-1) is given by an edge list (no multi-edges). A bridge is an edge whose removal increases the number of connected components. Return the number of bridges. Constraints: 1 <= n <= 10^5; the edge list has no duplicate edges and no self-loops.
Implement
count_bridges(n: int, edges: list[list[int]]) → intExamples
in
[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]out2What 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 35 min
solution.py
InputExpectedGot
[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]2not run yetsample