Loading interview...

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
mid, senior

Interview Prompt

A network monitoring tool needs to find the minimum number of hops between two nodes in an unweighted graph. Given an adjacency list and two node names, write a function that returns the minimum number of edges to traverse. Return -1 if no path exists.

How This Interview Works

  1. Read the vague prompt (just like a real interview)
  2. Ask clarifying questions to the AI interviewer
  3. Write your python solution with real code execution
  4. Get instant feedback and a hire/no-hire decision