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.