Find shortest path from nearest taxi stand to passenger
Filed under Uber
The question
Given an n x m grid where 0 represents a road and 1 represents a building, a list of taxi stand coordinates, and a passenger's coordinates (both located on roads), find the shortest path from the closest taxi stand to the passenger. Return the path as a list of coordinate pairs, or an empty list if unreachable.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.