Hello all!
In this video we will be solving a hard problem on LeetCode which is Binary tree Maximum Path sum. In this problem we are supposed to find a path in the Binary tree (which does not need to pass through the root), which gives us the maximum sum on adding the values in the path.


Do like and subscribe if you find it helpful!

свернуть