← Microsoft questions

Shortest root-to-leaf path matching target sum

Filed under Microsoft

Given a binary tree and an integer targetSum, find the length (number of nodes) of the shortest path from the root to any leaf node such that the sum of the values along the path equals targetSum. If…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.