The Family Reunion
A medium Python mock interview question on DataDriven, with an AI interviewer who asks follow-up questions and a hire or no-hire decision at the end.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L4
Interview Prompt
Given the root of a binary search tree stored as nested dicts with keys 'val', 'left' and 'right', where a missing child is None, and two values p and q that are present in the tree, 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 and run your Python against test cases
- Answer the interviewer's follow-up questions, then get a hire or no-hire decision