Binary tree maximum path sum | Leetcode

This video explains a very important interview programming question which is to find the maximum path sum in a binary tree. This is a very important binary tree question and the problem is very similar to finding diameter of a binary tree. I have explained the intuition for solving this problem including all the cases to be handled. I have explained the code flow with proper examples and code explanation is present at the end of the video.As usual, CODE LINK is present in the description below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

CODE LINK: https://gist.github.com/SuryaPratapK/...

Similar Problem:
Diameter of a binary tree:    • Diameter of a binary tree | Leetcode ...