Interview Guides

Upgrade

All questions/Coding/Maximum Path Sum in Tree

Maximum Path Sum in Tree

Hard

Coding

Asked at 1 company1TreesGraphsRecursion

Also asked at

Problem

Given the root of a binary tree, return the maximum sum of any path. A path may start and end at any nodes, must follow parent-child edges, and cannot revisit a node.

Examples

Example 1

Inputroot = [1,2,3]Output6WhyThe best path is 2 -> 1 -> 3.

Example 2

Inputroot = [-10,9,20,null,null,15,7]Output42WhyThe best path is 15 -> 20 -> 7.

Constraints

1 <= number of nodes <= 3 * 10^4
-1000 <= node value <= 1000
The input is a valid binary tree

Problem

Given the root of a binary tree, return the maximum sum of any path. A path may start and end at any nodes, must follow parent-child edges, and cannot revisit a node.

Examples

Example 1

Inputroot = [1,2,3]Output6WhyThe best path is 2 -> 1 -> 3.

Example 2

Inputroot = [-10,9,20,null,null,15,7]Output42WhyThe best path is 15 -> 20 -> 7.

Constraints

1 <= number of nodes <= 3 * 10^4
-1000 <= node value <= 1000
The input is a valid binary tree

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

All questions/Coding/Maximum Path Sum in Tree

Maximum Path Sum in Tree

Hard

Coding

Asked at 1 company1TreesGraphsRecursion

Also asked at

Problem

Given the root of a binary tree, return the maximum sum of any path. A path may start and end at any nodes, must follow parent-child edges, and cannot revisit a node.

Examples

Example 1

Inputroot = [1,2,3]Output6WhyThe best path is 2 -> 1 -> 3.

Example 2

Inputroot = [-10,9,20,null,null,15,7]Output42WhyThe best path is 15 -> 20 -> 7.

Constraints

1 <= number of nodes <= 3 * 10^4
-1000 <= node value <= 1000
The input is a valid binary tree

Problem

Given the root of a binary tree, return the maximum sum of any path. A path may start and end at any nodes, must follow parent-child edges, and cannot revisit a node.

Examples

Example 1

Inputroot = [1,2,3]Output6WhyThe best path is 2 -> 1 -> 3.

Example 2

Inputroot = [-10,9,20,null,null,15,7]Output42WhyThe best path is 15 -> 20 -> 7.

Constraints

1 <= number of nodes <= 3 * 10^4
-1000 <= node value <= 1000
The input is a valid binary tree

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Maximum Path Sum in Tree | Dataford Interview Questions - Dataford - Ace your Interview