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
Given a binary tree represented as a dict with keys 'val', 'left', 'right' (subtrees or None), return True if for every node the heights of its left and right subtrees differ by at most 1 AND both subtrees are 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