Binary Tree Maximum Path Sum at Arista Networks
Hard42.0% acceptance
This problem has 62.5% frequency at Arista Networks.
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 hintsTopics
Also asked at 24 companies
More Arista Networks Questions
Rotated DigitsMediumCourse Schedule IIMediumMaximum Depth of Binary TreeEasyBest Time to Buy and Sell StockEasyKth Largest Element in a StreamEasy
View all Arista Networks questions