Question d’entretien chez TuSimple

Dynamic programming, shortest path in graph.