dsa1 min read
Path Sum — Root-to-Leaf DFS with Running Remainder
Determine if a root-to-leaf path exists with a given sum using DFS that subtracts each node value from the target.
Read →
Path-sum
2 articles
dsa1 min read
Path Sum II — DFS Backtracking All Paths
Collect all root-to-leaf paths with a given sum using DFS backtracking, appending and removing the current node.
Read →