How should I practice Tree Level with the Most Nodes?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP onsite interview problems in FastPrep.

Is Tree Level with the Most Nodes associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP onsite interview coding practice problem when the problem catalog has that company and stage context.

Tree Level with the Most Nodes

Bloomberg LP● EasyNEW GRADONSITE INTERVIEW

Learn

Problem statement

Given the root of a binary tree, return the zero-based depth that contains the greatest number of non-null nodes.

The root is at depth 0. If several depths contain the same maximum number of nodes, return the shallowest such depth. Return -1 for an empty tree.

Function

widestLevel(root: TreeNode) → int

Examples

Example 1

root = [1,2,3,4,5,null,7]return = 2

The level sizes are 1, 2, and 3, so depth 2 contains the most nodes.

Example 2

root = [1,2,3,4,null,null,5]return = 1

Depths 1 and 2 each contain two nodes. The shallower tied depth is 1.

Example 3

root = []return = -1

An empty tree has no level.

Constraints

The tree contains at most 100000 nodes.
-100000 <= Node.val <= 100000.