Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (LeetCode 1489)
HardLeetCode 1489 · MST · Google, Amazon +2 · 49:10Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree · Broken in Steps · Leetcode-1489My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 1489 Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree by codestorywithMIK: Graphs, Hard. Topics: Union-Find, Graph Theory, Sorting, Minimum Spanning Tree. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Component, Prim's Algorithm, Kruskal's Algorithm, Borůvka's Algorithm
- Patterns
- MST
- Chapter
- Graphs
- Duration
- 49:10