Section 1Understand Problem
Section 01
Understand the problem
Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.
Problem statement
Given the root of a binary tree, return the sum of every node's *tilt*, where a node's tilt is the absolute difference between the sum of all its left subtree node values and the sum of all its right subtree node values. The tilt of a `null` node is `0`.
Example
root = [1, 2, 3] → 1
Constraints
0 ≤ #nodes ≤ 10⁴ · −1000 ≤ node.val ≤ 1000
Audio recording unsupported on this browser.
WPM—Fillers0Pace—Thinking0%
Explain the problem in your own words
0 words0 chars
AI Review
Write your thinking above first.
Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.
Ready to submit Section 1?
The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.
Write at least a couple of sentences explaining the problem before submitting.