TuSimple interview question

Dynamic programming, shortest path in graph.