The Shortest Route
A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L4
Interview Prompt
A message-routing service keeps an adjacency dict mapping each node to the nodes it can forward to directly. Given that `graph` and two node names, return the fewest hops from `start` to `end`, or -1 when `end` can't be reached.
Summary
Fewer hops is always better.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision