Practice Bloomberg Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Traverse an N-ary tree level by level to count nodes at each depth.
Identify and return the shallowest level with the maximum node count.
Handle edge cases such as empty trees or single-node inputs.

What This Tests

Breadth-First Search and level-order traversal techniques
Queue management for layered processing
Tree structure navigation and node aggregation
Tie-breaking logic and boundary condition handling

Common Patterns

DFS/BFS

Graph Traversal

Stdout

-