Binary tree maximum path sum leetcode | binary tree maximum path sum python | leetcode

Please like the video, this really motivates us to make more such videos and helps us to grow. thecodingworld is a community which is formed to help fellow student and professionals looking to crack the “coding interviews”.

We love solving and sharing problems which are frequently asked in technical interviews and voted by community at various websites.

✅ For more and upcoming updates join our community

#leetcode #python

[SaddamHossain-vgqe]

Your explanation is much more easier to understand than others!

[mrinaliniiyer]

your explanations are really crisp and on point! I am new to programming an i am finding your videos really useful! Could you suggest some site / course to build up my concepts?

[jagdishwarbiradar]

Explains well, but if in place of -10 if there is +10, then we have already the max value at right side is 42, and left side is 9, on root - It take L+R+root.val, i.e 42+9+10, that is 61 , but the answer will be 35+10+9, tell me where I am wrong ?

[tanish]

I am ready to take may challenge if u continue

[mangershubham]

what if it passes through the root all the time. Which line to be removed?

[coolguychemistry]

The explanation is incomplete, there are cases not been considered. Even the cases that are part of code are not part of explanation. Kindly don't make such videos. Firstly, This gives false belief that this question can be easily solved.Secondly it will give bad name to you and it will not be good for you in long term. Rest is up to you.

[kanchanapy]

Explanation power is really good but in the above tree, if we switch 15 and 7, then according to the explanation above, the max at level 20 comes to (15+15+20) = 50! or there's some mistake in the explanation. Because if we apply same logic as applies to node with value 20, then the answer is incorrect.

[fangyiyu]

The first thing I do after opening my computer every day is to watch your video

[meowmr]

Perfect explanation. Best explanation out there man. Thank you so much!

[lets_see_]

why are we doing 9+42+(-10) if 42 is actually made up of 2 paths already, shouldn't we choose only max from left or right of 20 to be the part of path?

[TheArbaaz-rntq]

it means if we want to pass must from the root then we only need return max line 18?

[mayankrathi]

U r making it easier day by day..thanks a lot

[anaspatankar]

Why would the answer with root not include the 7?

[PrajyotMane]

Nice explanation. The 0 in max( ) is very important, I feel you should have explained its use in the video. Great video btw.

[Kushagra_]

can u explin the line 17 plzz didnt get it.