Available question text
Given a binary tree, compute the sum of node values at each depth and return the level index that has the minimum sum (if multiple levels tie, return the smallest index). This requires aggregating level sums efficiently—commonly via level-order traversal or depth-indexed accumulation.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3157. Find the Level of Tree with Minimum Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source