Closest Route via DFS | Dataford Interview Questions

Find the closest route to get to a destination (DFS-based graph search).

Asked in the Phone screen stage.

Implement find_closest_route(graph, start, destination). The input graph is a dictionary mapping each node to a list of adjacent nodes. Return a list containing a route with the fewest edges from start to destination, or [] if no route exists. Routes must not repeat nodes. If multiple shortest routes exist, return the one encountered first according to adjacency-list order.

Constraints

1 <= number of graph nodes <= 20
Each adjacency list contains distinct node names
The graph is unweighted and directed
A route may not repeat a node
If multiple shortest routes exist, use adjacency-list order as the tie-breaker

Function Signature

def find_closest_route(graph, start, destination):

Your question is Closest Route via DFS. 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

Find the closest route to get to a destination (DFS-based graph search).

Asked in the Phone screen stage.

Constraints

1 <= number of graph nodes <= 20
Each adjacency list contains distinct node names
The graph is unweighted and directed
A route may not repeat a node
If multiple shortest routes exist, use adjacency-list order as the tie-breaker

Function Signature

def find_closest_route(graph, start, destination):

Your question is Closest Route via DFS. 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.