LeetCode
Experience
#1489 Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
Interview Experience
LeetCode #1489: Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree. Difficulty: Hard. Topics: Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Component. Asked at Google in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Graph Theory
Minimum Spanning Tree
Strongly Connected Component
Union-Find
Graph
Sorting
Union Find