# Find Critical And Pseudo Critical Edges In Minimum Spanning Tree: Practice Notes
Find Critical And Pseudo Critical Edges In Minimum Spanning Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
For each edge, decide if it is in every MST (critical), some but not all (pseudo-critical), or none. Sort edges and run Kruskal: an edge is critical if forcing it out raises the MST cost (or disconnects); it is pseudo-critical if forcing it in still achieves the original MST cost.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(E^2 α(V)) with Kruskal per edge.
## Common mistake
Comparing only connectivity and not MST weight, or treating every MST edge as critical.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview helper that uses your resume.