Halloween SalePremium questions, over 30% offUnlock all premium questions for over 30% off
Tree Min Leaf Sum
Easy
Question
You are given an N-ary tree where each node has an integer value. Find the minimum sum path from the root to any leaf node and return that sum. ...
Asked at:Bloomberg
More Bloomberg interview questions
- Multi File Word Searchmedium
- Fuel Grid Navigationhard
- Dual Extremes Queuehard
- Stream Palindromemedium
- Hailstone Sequence Stepseasy
- Trade Volume Trackereasy
- Word Puzzle Filtereasy
- Equivalence Groupsmedium
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.