The Family Reunion
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
Given the root of a binary search tree (as nested dicts with 'val', 'left', 'right') and two integer values p and q present in the BST, return the value of their lowest common ancestor.
Summary
Two cousins share a common ancestor somewhere above.
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