Count articulation points
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]]) → 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