Видео

Can you join source code with it. As github repo or ss.

Amazing and clear explanation as always

love from colombia❤

22:43 If anyone is thinking about the edge case where one of the target node is the ancestor... for cases where lca(p,q) = p or lca(p,q) = q. Path of one of the node will be "commonPath" and Path of second node will be "commonPath" + "some additional moves". Example: let's say p is the ancestor node. That means ancestor(p,q) = p. path from root to p is "LLRRLR" path from root to q is "LLRRLRLLRR" Now as you can see path of p is actually the prefix of path of q. Still our logic remains same, replace path of p with. "U" and add leftover path of q. So output will be "UUUUUULLRR".

Started new journey

😍😍😍

Please watch LCA before watching this video. Do like the video, if you understood the solution. Like target for this video is 100. ☺☺ ruclips.net/video/m9NKcTvrhSc/видео.html

Nice

thank you sir.

Thanks 😊

Huge Inspiration !! Please keep continuing.. I am an international student here in USA. I am highly benefited from your videos !!

osm explain

❤❤❤

Thank you sir.

bro description is a 2-d array so iterating it should take O(n^2) . isn't it?

OMG this sol is great.Its so compact.Thank you so much.Also thankyou for doing it in java.Everyone does it in C++ and myself being only one doing DSA/CP in java...I struggle to find sol on youtube.Thank you so much!

Thanks 😊

Animal ek class and dog,cat, monkey these are objects

we are returning only root then how all others elements are printed ? can you explain please

Today 15 July 2024 i'll start the playlist.

Keep Going 👌👌

Thanks bhaiya 🙏

Bhaiya ye wala lecture bahut complex hai samajh me nhi aaraha....

If you have understood the explanation, please do like the video 😊. Like target for this video is 90

gjb explain sir

Sir what is the space complexity?

love from china❤

first

Best explanation!

[1] Vegetables = class, Aloo, bhindi, Gajar=Objects, [2] Sweets=class, Kaju Katli, balMithai, rasgula, gulabjamun = objects :)

Great

Thank you for explaining, i actually code in c++, i came here know the concept & implementation... and you save me♥♥

Please do like, if you understood 😊. Like target for this video is 90

very nice explanantion sir,Thankyou

❤❤❤

Thanks 😊

bhai khatranaak mza aagya

wow what a content. Thank you so much sir❤❤❤❤

bhaiya mana ya code c++ ma kiya to some test case pass ne ho ra ?..

love from spain♥

Respect for all those who came here after seeing the chemistry in a leet code question! Only Shashwat bhai can save us!

What is the TC

Sir wo remove substring "ab" and "ba" to get max point question ke video pe doubt comment Kiya haii.. Please sir solve krdo

the best part is , you helping us think organically, thank you so much

kuch smaj nahi aa raha haii

Can you please take up the Leetcode 146. LRU Cache problem to explain in a video?

Great you gained a sub

not working for second case

We don't have to push any left moving robot to the stack. Also, We can just check at the start of the while loop that if the health of the left moving robot becomes 0 then we break out of the while loop.

Sir please update your version Yup study model like 1990s Git gaakar r1 r2 r3 bol rhe ho ye kya tarika hai