← Back
00:00

Tree Min Leaf Sum

Bloomberg interview questions · Easy · Coding round · 6 tests

Find the smallest root-to-leaf path sum in an N-ary tree, even when values can be negative.

The full question, tests and reference solution are available with a plan that includes Bloomberg.

Idle