Binary Tree Maximum Path Sum at Amazon

Hard42.0% acceptance

This problem has 62.5% frequency at Amazon.

Problem Description

A **path** in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence **at most once**. Note that the path does not need to pass through the root. The **path sum** of a path is the sum of the node's v...

Read full problem and hints

Topics

Dynamic Programming Tree Depth-First Search Binary Tree

Also asked at 24 companies

Apple Arista Networks Baidu Bloomberg Citadel Datadog DoorDash Flipkart Goldman Sachs Google Meta Microsoft Nutanix NVIDIA Oracle PayPal Salesforce Snapchat TCS TikTok+4 more

View Full Problem

Problem Description

Topics

Also asked at 24 companies

More Amazon Questions