Bounded Hop Graph Pathfinding in Python | Dataford Interview Questions

Tell me about solving a complex Python challenge within a strict 60-minute timeframe.

Implement minimum_cost_route(graph, start, end, max_hops), where graph is a map from node strings to arrays of [neighbor, cost] pairs. Return the minimum total cost from start to end using at most max_hops directed edges, or -1 when no such route exists. Edge costs may be negative, but the hop limit is finite.

Constraints

0 <= max_hops <= 1000
The graph contains at most 10,000 nodes
Each adjacency entry contains a neighbor string and an integer edge cost
Edge costs may be negative
The hop limit is finite, so negative cycles do not cause an unbounded result

Function Signature

def minimum_cost_route(graph, start, end, max_hops):

Your question is Bounded Hop Graph Pathfinding in Python. 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

Tell me about solving a complex Python challenge within a strict 60-minute timeframe.

Constraints

0 <= max_hops <= 1000
The graph contains at most 10,000 nodes
Each adjacency entry contains a neighbor string and an integer edge cost
Edge costs may be negative
The hop limit is finite, so negative cycles do not cause an unbounded result

Function Signature

def minimum_cost_route(graph, start, end, max_hops):

Your question is Bounded Hop Graph Pathfinding in Python. 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.