The Level Summer
A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L3
Problem
Given a tree rooted at a dict {'val', 'children': [...]}, return a list where position i is the sum of all node vals at depth i (root is depth 0).
Summary
Add up each level of the tree.
Practice This Problem
Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.