Array or Graph Algorithm Challenge | Dataford Interview Questions

Solve a medium-level algorithmic challenge involving array manipulation or graph traversal, focusing on optimal time and space complexity.

Implement shortest_path(graph, start, target) for a directed graph represented by an adjacency list. Return a shortest path including both endpoints, or [] when the target is unreachable. For equal-length paths, follow neighbors in their listed order.

Example: graph = [[1, 2], [3], [3], []], start = 0, target = 3 returns [0, 1, 3]. Nodes are integer indices from 0 through len(graph) - 1.

Constraints

1 <= len(graph) <= 500
Each neighbor is an integer from 0 through len(graph) - 1
The graph may contain cycles and duplicate edges
The graph is directed
Return any shortest path, using adjacency-list order to break ties

Function Signature

def shortest_path(graph, start, target):

Your question is Array or Graph Algorithm Challenge. 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

Solve a medium-level algorithmic challenge involving array manipulation or graph traversal, focusing on optimal time and space complexity.

Example: graph = [[1, 2], [3], [3], []], start = 0, target = 3 returns [0, 1, 3]. Nodes are integer indices from 0 through len(graph) - 1.

Constraints

1 <= len(graph) <= 500
Each neighbor is an integer from 0 through len(graph) - 1
The graph may contain cycles and duplicate edges
The graph is directed
Return any shortest path, using adjacency-list order to break ties

Function Signature

def shortest_path(graph, start, target):

Your question is Array or Graph Algorithm Challenge. 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.