dsa8 min read
Bridges and Articulation Points — Critical Edges and Cut Vertices [LC 1192, Google, Meta]
Use Tarjan's low-link technique to find every bridge (critical edge) and articulation point (cut vertex) in an undirected graph in O(V + E). The interview pattern behind LeetCode 1192 Critical Connections, asked at Google, Meta, and Amazon.
Read →