← Microsoft questions

Smallest path from root to leaf with given sum in constant space

Filed under Microsoft

Given a binary tree and a target sum, find the length (or existence) of the path from the root to a leaf node that sums up to the target, adhering strictly to constant auxiliary space O(1).

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.