Twilio SDE Interview Question 2021 December | Trees | on-campus

Question 1 Problem Statement A path in a binary tree is a sequence of nodes where each pair of adjacent nodes has an edge connecting them. A node can only appear in the sequence at most once. The path does not need to pass through the root. Given the root of a binary tree, return the maximum path sum of any non-empty path. Constraints The number of nodes in the tree is in the range [1, 3 x 104] -1000 ...