โ† TCS questions

Explain Dijkstra's algorithm, Kruskal's algorithm, and BFS

Filed under TCS

Describe the operational mechanics, time complexities, and applications of Dijkstra's shortest path algorithm, Kruskal's minimum spanning tree algorithm, and Breadth-First Search (BFS).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related TCS questions

Collected from public candidate posts and coding forums. Updated Nov 2026.