Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Trees

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Trees

Path Sum

beginnerlayer I1 · Trees5 tests

Given a binary tree and a number targetSum, return true if some root-to-leaf path has values adding up to exactly targetSum.

  • A leaf is a node with no children — a path must reach one, it cannot stop halfway
  • An empty tree has no paths, so the answer is always false
  • Values may be negative

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen