Grokking the Coding Interview: Patterns for Coding Questions

Ask Author

Back to course home

0% completed

Problem Challenge 2: Path with Maximum Sum (hard)

Problem Statement

Find the path with the maximum sum in a given binary tree. Write a function that returns the maximum sum.

A path can be defined as a sequence of nodes between any two nodes and doesn’t necessarily pass through the root. The path must contain at least one node.

Constraints:

The number of nodes in the tree is in the range [1, 3 * 10<sup>4</sup>].
-1000 <= Node.val <= 1000

Try it yourself

Try solving this question here:

.....

.....

.....

Like the course? Get enrolled and start learning!