LeetCode: Path Sum Solution

Keep subtracting

Approach

Subtract targetSum by node.val during traversal

When reaching leaf node, if targetSum is equal to node.val then there exist a path

Implementation

1var hasPathSum = function (root, targetSum) {
2  if (!root) return false
3  if (!root.left && !root.right) return root.val === targetSum
4  targetSum -= root.val
5  return hasPathSum(root.left, targetSum) || hasPathSum(root.right, targetSum)
6}

References

Original problem

Comments

Loading comments...

Apply and earn a $2,500 bonus once you're hired on your first job!

Clients from the Fortune 500 to Silicon Valley startups

Choose your own rate, get paid on time

From hourly, part-time, to full-time positions

Flexible remote working environment

A lot of open JavaScript jobs!!

Fact corner: Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.

Still hesitate? Read HoningJS author's guide on dealing with Toptal interview process.

LeetCode: Search a 2D Matrix

Flatten into 1D array

LeetCode: Path Sum III

If timebox exceeded, read other solutions

HONING JS

LeetCode: Path Sum Solution

Approach

Implementation

References

Similar problems

Comments

Tags

Apply and earn a $2,500 bonus once you're hired on your first job!

Next Post

Previous Post