Skip to content
← Published challenges

Checkpoint · revision 1

Trees, Graphs & Pathfinding Checkpoint

Check traversal, connectivity, and shortest-path reasoning by the invariant each algorithm maintains.

Scenario

A map contains unweighted connections, weighted roads, and repeated connectivity queries.

Scored questions

Question 1

Which structure normally drives breadth-first search?

Question 2

Which invariant defines a binary search tree?

Question 3

Path compression improves repeated Union-Find operations by:

Question 4

How many edges are relaxed from a settled node with 4 outgoing edges in one Dijkstra expansion?

Answer keys, scoring tolerance, XP, and awards stay on the server. Retrying the same attempt cannot award twice.