Shortest Path with Equal Edge Weights | Dataford Interview Questions

Shortest path in a graph where all edges have equal weight (solved with BFS).

Asked in the OA stage. OA question 1 of 2, 90 minutes total.

Input and Output

Implement shortest_path(n, edges, start, target). The graph has vertices 0 through n - 1, and each edge is undirected. Return the minimum number of edges from start to target, or -1 if no path exists.

Constraints

1 <= n <= 1000
0 <= len(edges) <= 2000
0 <= start, target < n
Each edge has two distinct endpoints in the range [0, n - 1]
The graph is undirected and may contain cycles

Function Signature

def shortest_path(n, edges, start, target):

Your question is Shortest Path with Equal Edge Weights. 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