248. Path Sum III

MediumTree

Given the `root` of a binary tree and an integer `targetSum`, return the number of paths where the sum of the values along the path equals `targetSum`. The path does not need to start or end at the root or a leaf, but it must go **downwards** (i.e., traveling only from parent nodes to child nodes).

Examples

Input: [10,5,-3,3,2,null,11,3,-2,null,1] 8

Output: 3

Explanation: Three downward paths sum to 8: 5→3, 5→2→1, and -3→11.

Constraints

  • The number of nodes in the tree is in the range [0, 1000].
  • -10^9 <= Node.val <= 10^9
  • -1000 <= targetSum <= 1000
Loading...

Run checks all cases above. Submit evaluates all test cases.