LeetCode 1489 - Find Critical and Pseudo Critical Edges in Minimum Spanning Tree

Parent index: LeetCode 500 Problem Index MOC

Problem Metadata

• LeetCode URL: https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/
• Frontend ID: 1489
• Difficulty: Hard
• Primary category: Graphs
• Source lists: NeetCode Practice, NeetCode 250

Related Algorithms

• Graphs
• Dijkstra’s Algorithm
• Union-Find
• Topological Sort

Research Status

• Problem statement and constraints verified against the LeetCode page.
• Core algorithm explained in paper-style prose.
• Worked examples, edge cases, complexity proof, and pitfalls added.
• Solution variants linked back to the relevant algorithm notes.

See Also

• LeetCode 500 Problem Index MOC
• SWE Interview Preparation MOC