Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Roads with a Toll Budget > Editorial

Roads with a Toll Budget — Solution & Editorial

Back to the Problem

Layered Dijkstra over the state (node, tolls-spent): each edge either keeps or increases the toll layer. The answer is the minimum over all layers at node N.

Complexity: O((C+1) · M log(N·C))

Watch out: The state space is node×(C+1); treating tolls as ordinary weight loses the budget constraint.