← Walmart questions

Modified Dijkstra Algorithm for Train Routes

Filed under Walmart

Given a train network represented by trips [origin, destination, departure_time, arrival_time], find the earliest arrival time at a destination station starting from a source station at start_time.

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

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