The Hierarchy Builder
A hard Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- hard
- Seniority
- L5
Interview Prompt
Given a list of [parent, child] pairs, build a nested dict tree. The root is the parent that never appears as a child. Each parent maps to a dict of its children (by name). Leaves have empty dicts {}. Assume a single root.
Summary
Parent-child pairs, flat. Build the family tree.
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