← All practice quizzes🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →
Quiz: Shortest Paths
5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass
Find the cheapest route in a weighted graph. Dijkstra with a min-heap traced step by step, Bellman-Ford for negative edges and negative-cycle detection, and the 0-1 BFS trick, in Python and Java.
Log in to take the quiz
Free account · see your score, answers and explanations, earn XP