The Balanced 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
- L4
Interview Prompt
You're validating binary trees coming out of a parser, each given as a nested dict with keys `val`, `left`, and `right`, where a missing child is `None` and the whole tree may itself be `None`. Return `True` when the tree is height-balanced: at every node the heights of the left and right subtrees differ by at most 1. An empty tree counts as balanced.
Summary
Every branch should carry the same weight.
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