Problem Submissions Solution
Binary Tree Maximum Path Sum
Difficulty: Hard
Acceptance: %
Points: 40.00
Given a binary tree, the task is to find the maximum path sum. The path may start and end at any node in the tree.
Examples:
Expected Time Complexity: O(n)
Expected Auxiliary Space: O(log n) for recursive calls.
Constraints:
- 1 <= number of nodes <= 10^3
- -10^4 <= node->data <= 10^4
Companies:
Google Flipkart
Topics:
Tree
