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 maximum *width* of the tree. The width of a level is the number of nodes between the leftmost and rightmost non-null nodes at that level (inclusive), where null nodes between them count toward the width as if they were present in a complete binary tree.
Example
root = [1, 3, 2, 5, 3, null, 9] → 4
Constraints
1 ≤ #nodes ≤ 3000 · −100 ≤ node.val ≤ 100
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.