CodingHardcod-g889

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

Question

Given an undirected simple graph on n nodes (0..n-1) as edges [u, v] (no self loops or parallel edges), return the number of articulation points (cut vertices): nodes whose removal (with their incident edges) increases the number of connected components. Constraints: 1 <= n <= 60.

Implement

count_articulation(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.