arrow_back Back to Challenges

#437 Path Sum III

Medium Acceptance 0%
description

Problem Description

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.

checklist Constraints

See problem description for detailed constraints.

science Examples

Case #1

In: # See problem description for input format
Out: # Expected output

Mastery Tags

Hash Table Recursion Trees

Hiring Companies

Adobe Bloomberg
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude