Skip to main content
Binary Tree Maximum Path Sum | AlgoCracked
AlgoCracked
ProblemsBinary Tree Maximum Path Sum
Hard39.0% acceptance
Blind75TreeDfsDynamic Programming

Binary Tree Maximum Path Sum

A path in a binary tree is a sequence of nodes where each adjacent pair is connected by an edge; a node appears at most once and the path need not pass through the root. The path sum is the total of its node values. Return the maximum path sum over all non-empty paths. Input format Level-order JSON array with nulls, e.g. [[-10,9,20,null,null,15,7]] . TreeNode is predefined.

Loading workspace…