Problem 437 · Medium

Path Sum III

Count downward paths in a binary tree whose node values add up to a target sum, where a path may start at any node. The visual walks the tree keeping running prefix sums along the current branch and flags each match as it is found.

Open the interactive visualisation