Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 437. Path Sum III
Count how many downward paths (parent→child, can start and end at any nodes) in a binary tree sum to a given target. The challenge is to efficiently enumerate all contiguous root-to-node subpath sums (often solved with prefix-sums + a hashmap) instead of checking every start node brute-force.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.