# Remove Max Number Of Edges To Keep Graph Fully Traversable: Walkthrough
Remove Max Number Of Edges To Keep Graph Fully Traversable shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Give type-3 (both-use) edges first to Alice and Bob Union-Finds, then type-1 and type-2. Every edge that does not connect a new pair can be deleted. Fail if either person is left with more than one component.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 α(n)).
## Common mistake
Processing Alice-only or Bob-only edges before the shared ones, which wastes edges that both needed.
## 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 real-time AI interview assistant for live interviews.