Technical interview guide
Advanced Graphs
Weighted shortest paths and connectivity beyond plain BFS/DFS: Dijkstra, Union-Find, and minimum spanning trees.
- Read
- 46 min
- Practice MCQs
- 25
- Interview Q&A
- 25
- Edition
- v7
- Editorial status
- Reviewed
- Relevant for
- Embedded Systems Engineer
Scope: Language-neutral, with implementation notes referring to CPython 3.14 containers.
Curated: · Written: · Reviewed: