Graph Path-Finding Solution | Dataford Interview Questions

Implement a solution for a graph-based traversal or path-finding challenge relevant to Via Transportation routing or dispatch.

Given directed weighted edges, return the minimum total cost and the corresponding route from start to destination. Return [-1, []] when the destination is unreachable. Implement shortest_route(edges, start, destination), where edges is a list of [from_node, to_node, cost] entries and node identifiers are strings. Edge costs are nonnegative, and a route may contain each node at most once.

Constraints

1 <= len(edges) <= 100000
1 <= len(edge endpoints) <= 100000
Each edge has the form [from_node, to_node, cost]
Node identifiers are non-empty strings
0 <= cost <= 10^6
The graph is directed
Return any minimum-cost route when multiple routes have the same cost

Function Signature

def shortest_route(edges, start, destination):

Your question is Graph Path-Finding Solution. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Implement a solution for a graph-based traversal or path-finding challenge relevant to Via Transportation routing or dispatch.

Constraints

1 <= len(edges) <= 100000
1 <= len(edge endpoints) <= 100000
Each edge has the form [from_node, to_node, cost]
Node identifiers are non-empty strings
0 <= cost <= 10^6
The graph is directed
Return any minimum-cost route when multiple routes have the same cost

Function Signature

def shortest_route(edges, start, destination):

Your question is Graph Path-Finding Solution. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.