Leetcode 3157. Find the Level of Tree with Minimum Sum

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3157. Find the Level of Tree with Minimum Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact