TuSimple Interview Question

Dynamic programming, shortest path in graph.