Check Root-To-Leaf Target Sums In A Binary Tree
Company: Hudson River Trading
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: easy
Interview Round: Technical Screen
Overview: Practice a binary tree path-sum interview problem that asks whether any root-to-leaf path reaches a target value, including empty trees, single-node trees, and negative values. This prompt is useful for candidates preparing DFS recursion, leaf conditions, and edge-case reasoning in coding screens.
Read the full Hudson River Trading Software Engineer interview experience this question came from