โ† Deloitte questions
CodingMedium to Hard

Dijkstra/Prims and Dynamic Programming

Filed under Deloitte

Implement Dijkstra's or Prim's algorithm to find shortest paths or minimum spanning trees, and solve a related dynamic programming problem.

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 Deloitte questions

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