CodingHardcod-g698

Subject Bridges articulationLevel Senior~35 minCommon in Algorithms & data structures interviewsIndustries Software development, Technology

Question

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]]) → int

Examples

in[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]out2

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.