Weighted routing and latency questions test algorithm preconditions more than template recall.
Loading Engineering Foundry…
Loading Engineering Foundry…
Choose a path algorithm from edge-weight assumptions and preserve a defensible distance invariant.
Weighted routing and latency questions test algorithm preconditions more than template recall.
Heap-based Dijkstra is typically O((V + E) log V); alternatives depend on weight and graph structure.
These clues narrow the model. They do not replace an invariant or complexity check.
Exact active distribution: 0 easy, 1 medium, 0 hard. External records contain metadata and original guidance only.
Optional introduction to weighted shortest paths after BFS is comfortable.
Question pages let you record local completion. Account status, confidence, notes, and a topic roll-up are shown only when private account persistence is available.
Open practice workspaceExplore decision trees systematically and prune invalid partial work.
Open the roadmap