Binary Tree Maximum Path Sum - (Google, Meta, Amazon, Flipkart) : Explanation ➕ Live Coding
ฝัง
- เผยแพร่เมื่อ 19 ก.ย. 2024
- This is the 18th Video of our Binary Tree Playlist.
In this video we will try to solve a very good Qn "Binary Tree Maximum Path Sum".
We will do live coding after explanation and see if we are able to pass all the test cases.
Problem Name : Binary Tree Maximum Path Sum
Company Tags : Google, Meta, Amazon, Flipkart
My solutions on Github : github.com/MAZ...
Leetcode Link : leetcode.com/p...
GfG Link : practice.geeks...
My GitHub Repo for interview preparation : github.com/MAZ...
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish
This is the first video that I have watched and I have to admit I'm in love with your voice as well as your teaching skills. Thank you is not enough for the work you are doing. I am glad I found you :) Soon will let you know what I achieved after watching all your videos :) God bless you Comrade
Thank you so much
Means a lot 😊
MIK bhai to poora famous hogae hain 😍
This guy can really give a tough competition to Striver in terms of Smooth Explanation, easy to understand way of teaching and the simplicity with which he makes us understand. Legend in making!
Thank you so much Chinmoy for your appreciation ❤️❤️❤️
@@codestorywithMIK Could you please upload a video solution of leetcode 2467. Most profitable path in a Tree?
Totally agree
True
True
This guy has some exceptional skills of explaining code . Mtlb itna ache s kon smjhata h yar. Har ek question ese smjhaya jata h jese hum chote bache he aur mil bhaiya hmare bade bhaiya.
He always keeps in mind ki koi bhi doubt na rahe hamare mind me and isliye br br vo hr cheej repeat bhi krte rhte he.
I understand that the variables were funny but that's where magic happens 😆
Time Complexity : O(n) -> Because we are visiting every node only once.
Sach me, variables are funny, magic variables.
Thanks a lot 😇
great explanation man
I was also stuck at what to return
So glad to know Aditya ❤️❤️❤️
You are a magician bro
you are nothing but a magician. No one can beat this level of explanation as of now on youtube.
bhaiiya i was watching your video in a browser where I didn't had any logged in account. But after watching i felt like "Yr iss bande ko subscribe aur like nhi krenge ko kisko krenge"....
Thanks Pure dil se for this great explanation. Now onwards I will ask doubts also from you whenever I am stuck in a problem.
Thank you so so much Tauquir
You made my day ❤️❤️❤️
Sahi baat
I have no words, Just keep it up, youtube ka best education channel bn skta hai ye.
Thanks a lot Mayank❤️❤️❤️
Already ban gaya hai ab to lagta hai
Indeed the variables were 🤣
But dude, you nailed it. You are literally crazy.
I have never ever seen this kind of thorough explanation. More power to you bro
💪
Glad to know 😂😂😂
And thanks a lot ❤️❤️❤️
When a man is hungry, it is better to teach him to fish than to give him a fish » attributed to Confucius . « If you give a man a fish, he’ll eat someday, if you teach him to fish, he’ll always eat
that's what you are doing.........rather than just giving the solution....you are
teaching us how to build logic🔥🙌
Indeed. So apt . I totally agree. This guy is something else
Thank you so much.
Your comment made my day ❤️❤️❤️❤️
@@codestorywithMIK your explanations make my day🙌..............after watching your video i feel like i have learnt something
@@oqant0424 Means a lot ❣
At this point, I am now convinced that this guy is the best in DSA among any other TH-cam channels
I thought no one could beat striver in dsa, but then I saw this channel.
what a guy!! this knowledge cannot be achieved even in paid courses! you are the king
Please start the DSA from zero advance if possible and make it huge , you will loved by everyone for sure
Sure Manish. I have a plan for that as well. Couldn’t start due to time crunch.
But planning it soon .
Thanks again for your valuable feedback ❤️❤️❤️
You are a gem bhai even though i have solved the question but came here to watch your solution cause I always learn something from your video.
Thank you for this amazing explanation.
Thank you so much Danish ❤️❤️❤️
Really great bhaiya you are really legend in explanation of code literally anybody who see your way of explanation will become truly fan of yours
your Hindi handwriting is also great bhaiya and you are absolutely right by your variable naming when I think of those variable names whole code came into my mind once again thanks bhaiya 😊😊😇
Thank you so much Uday ❤️❤️❤️
Bhai u r not the next anyone u r our first MIK. Mark my words this channel is going to become the best beating everyone else. Top class explanation.
This means a lot ❤️❤️🙏🙏
best explanation sir , earlier i was just mugging up this question, but now i found the right approach ,Thank You!
Mom look i found gold for motivating me to keep doing leetcode!
please suggest me any resources for learning stack queue linked list basics only for now ,, ASAP
Thanks a lot Chinmay.
I would suggest you to study any topic like this :
1) Understand the DS (example : stack)
2) Solve popular qns on them (Easy and Medium) . Don’t solve random ones. Solve which are frequently asked in interviews.
3) For company and interview qns : github.com/MAZHARMIK/Interview_DS_Algo
@@codestorywithMIK already starred your repo, but I need to learn stack , linked list, queue from basics , for that I need resources, can you suggest some
I learned them separately sometimes from TH-cam, sometimes from GfG.
I think, for leading a topic, GfG is good enough.
Then for solving qns, go for leetcode
@@codestorywithMIK ok got it..
great explanation bhaiya!
Noted Pranav. Thank you so much for watching ❣
Only video on this problem which is actually helpful.
Lots of love to you bro
reach++
bhai aag laga di.
Waise toh mane ye qn karliya tha but supporting your channel bro🔥
Thank you so much Piyush ❤️❤️❤️
@@codestorywithMIK bhai yeh variable naming bohot accha hai yar while practicing.
fokat ka comment likhna nahi padta har variable ke liye.
Bro you rock😎😎
Thanks a lot ❤️❤️❤️
Your channel is going to grow soon man
Thanks a lot Manish.
It means a lot to me. I just want all of us to grow together and not fall for paid courses in market. We can do it together 💪💪💪
Thanks again ❤️❤️❤️
Bro!!!!!! Salute to your Explanation 👏🙌
The variables really did the magic 😄
what an explanation!!!!!!!!!!
Thank you so so much ❤️❤️❤️
OMG, this is so good reasoning, You have my heart, so easy pezzy to crack such questions where similar approach is used.
Thanks a lot Gomzy ❤️
Really appreciate your comment 💝💝💝
Really Bhaiya, You are Great, You made this hard level question very easy ... you explained all the points very clearly. Thanku so much Bhaiya for providing us such a great videos which are helping us a lot in our Preparation. Really loved the your way of teaching and the explanation.
It means a lot 🙏😇
nice approach...love from Bangladesh❤
thanks bhaiya last part hi dekhne ayaa tha aur apne wahi bataya hai
you are genius ,the level of detail you have provided in this solution is amazing
Means a lot. Thank you so much 😇🙏❤️
You are a LEGEND
Soon people will know about you ❤
Thanku so much for THE GREAT EXPLANATION
Bro you will soon have a blast of subscribers....you are too good🔥
It means a lot to me ❤️❤️❤️
great explanation bhaiya
Thanks a lot Dilesh ❤️❤️❤️
Thanks for being consistent.
Nice Explanation dude
I Pray magic will happen with your this journey on youtube.
Thanks a lot ❤️❤️❤️
Amazing Explainations Sir!!!
great explaination bhaiya after watching intuition I was able to write code on my own. Thanks a lotttt
Thank you 😇🙏❤️
I was stuck in the proper explanation of line by line code, previously I knew the concept of finding max path sum but now I understood the code properly
Thank you so much ❤️❤️
bhaiya phli barr achhe se smj m aaya abhi tk code ratt rkha tha, ab #no_ratta_maar🥰
Bhai kya hi explanation hai yaar..😮 5 min me code krke uda diya mzaa aagya logic sunke..❤🎉
Thank you so much Tushar 😇🙏
@@codestorywithMIK Thanx to you vai🫡
as usual you are amazing ,unmatchable ,unbeatable in domain of explaining the concepts and intution
Dude loved this video man I am never gonna forget this answer
🙏🙏❤️❤️
I was stuck on this ques for such a long time after seeing so many youtube videos but you , sir explained this concept so beautifully that I'm in awe.
Also sir please make a q&a video , would love to know your journey ❤
It means a lot. Thank you so much ❤️❤️🙏🙏
Sure, I will make a video soon.
Feel free to share with your friends and colleagues ❤️❤️
Python Buds :)
# It's same as Diameter of Binary Tree
class Solution:
def maxPathSum(self, root: Optional[TreeNode]) -> int:
if not root :
return 0
res = float('-inf')
def helper(root) :
nonlocal res
if not root :
return 0
left = max(helper(root.left),0) if root.left else 0
right = max(helper(root.right),0) if root.right else 0
res = max(res,left + right + root.val)
return max(left,right) + root.val
helper(root)
return res
just the additional case, to handle negative paths, koi branching agar negative sums return kr rhi ho ,us case mei 0 return kardo ,
Bhai bhot hi mst explanation, contest k solution bhi kra dia kro please
Thank you so much.❤️❤️
Soon plans
this channel will never disappoint you.
Thank you so much . Means a lot to me 😇🙏
Bhai bade bade TH-camrs k video dekhe. Lekin isse acha explanation kahi nahi mila. Guruji ho aap.
If anyone can beat this level of explanation, I am ready to loose a bet of 1000 😂😂😂
Kuch din bad inka channel har jagah dikhega.
Inke jaisi explanation aur intuition koi nhi de pata .
Explanation was so easyy, i was like ki hogya bss itta hi, im loving ur videos nd learning alot from you, thankyou so much❤️
Thanks a lot Aman 💕
Great Video bhaiya!
Thanks a lot! Took me a good time to understand , but I was sure you can simply it.
Tooo Good 🙌
one comment for your god level teaching ❤
❤️🙏
Dhanyawad guruji
Means a lot. Thank you so much 😇🙏
beautifully explained!
Thank you so much Divyansh ❤️❤️
Great explanation ! Just subscribed this channel....
Thanks a lot Dhruv ❤️❤️❤️
JUST GREAT🤩
Thank you so much 😇🙏
kya bat bhai matlb maza agya...keep it up man🔥🔥
❤️❤️ thank you 😊
wow , beautifully explained .
Mujhe myCodeSchool waale teacher ki yaad agai .
I wonder, ya to aap wahi waale Sir ho, ya unke bhai ya bete honge 🤔
Nation wants to know 🤣
😂😂😂😂
MyCodeSchool’s tutor is a legend .
I stand nowhere compared to him 😁
But to answer your qn,
I am neither his son or brother 😂😂😂
Thanks btw ❤️
I’ll take that as a compliment 😅
Great explanation 🫡
Took the code of finding diameter and made some changes.
It got accepted 😅
AMAZING EXPLANATION, UNBEATABLE
Thank you for watching 😇🙏
you will be next striver for us .. may be even better than him .. keep it up
Yrr bhaiya maza aagya ❤️
This is brilliant...
Thank you so much 😇🙏❤️
Class solution {
Static int max Down sum(TreeNode root,int[]max value){
if(root==null)return0;
intleft sum=MATH.MAX
(0,max Down Sum((root.left,max value));
int right Sum=MATH.MAX (0 max Down sum(root. right ,max value));
max value (0)= Math.Max (max Value (0),left sum+right sum+root. Value);
return root. Value +Math.Max (left sum,right. Sum);
}
Public []int max pathsum (Treenode root){
int[]max value =new int[1];
Max value [0]=integer.MIN_VALUE;
max down sum(root,max value); return max value (0);
Maujj dila di bhai
Thank you so much Harshit ❤️❤️
AMAZING
Means a lot ❤️😇🙏
same bhaiya .....intuition aagya tha,code likh diya tha ......bas return kya karna hai wahi khel samapt ho gya.......
now,only i understood this...kon acha hai and kyu?,.. :)
❤
please explain why we are adding l ,it is pointer why its not l.val and r.val when adding to root.val
Op sir
Thank you 😇🙏❤️
🤯🤯🤯❤❤
❤️❤️❤️❤️
where is the case when adding root->val is decreasing the sum lets say root->val is -1000 l is 20 r is 30
agr root vale value he negative hogi to hum kon sai case ko consider karengai
maxSum ko humne initially maxSum = INT_MIN kar rakha hai.
So, root’s negative value will be greater than INT_MIN ,
So in that case we only take that root’s value which is the only choice we are left with.
The best way how i handle these, is to take a small example of the scenario you want to understand and do a dry run.
It always helps me
this is q-1373 of leetcode?
Hi, {name}
kaunsa editor use kia hai or tablet connected hai?
It’s the default Notes app of ipad 11 pro
After seeing his solution I lost respect for this problem 😅
🥹💓👌
Jisne apka Diameter of Binary Tree vala video dekha hoga vo esse easily bna lega...
I literally copy pasted that code and did some changes.
It got accepted 😅.
subscribe kr diya bhai....
video thumbnail & channel logo thoda improve ho skta h. Pdhate to bdhiya ho hi
Sure.
Point taken. Will improve them soon.
Thanks a lot ❤️❤️❤️