Loading interview...

The Order Inspector

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 database index validation tool needs to confirm that a binary search tree satisfies its ordering invariants at every node. Given a tree represented as a dictionary mapping node names to objects with 'val', 'left', and 'right' keys, and a root node name, return True if the tree is a valid BST.

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