#1495Medium· asked at 3 companies
Path Sum III
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: root = [10,5,-3,3,2,null,11,3,-2,null,1], targetSum = 8 Output: 3
5 -> 3, 5 -> 2 -> 1, and -3 -> 11.
Example 2
Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22 Output: 3
Constraints
- •
The number of nodes in the tree is in the range
[0, 1000]. - •
-10^9 <= Node.val <= 10^9 - •
-1000 <= targetSum <= 1000