FACEBOOK CODING INTERVIEW QUESTION - LOWEST COMMON ANCESTOR

[@manofacertainrage856]

I was taught a solution to this problem in a format that took roughly 30 minutes and left me confused. I looked for a backup explanation from my first three go-to people, didn't find one, and then found your explanation. Simple. Perfect. Thank you. The sad thing is that I had this question asked at ... :-)

[@madhavoberoi6441]

Undoubtedly one of the most underrated KZbinr/ teacher on KZbin!! Love your work man!!

[@AlgosWithMichael]

That means alot to me, thank you so much for watching! More videos on the way

[@krutikapatil5449]

This and the text justification videos are the best I have seen so far. Very clear explanation. Neatly done. Great work! And thank you!

[@AlgosWithMichael]

Wow, thanks!

[@agamdeeparora2342]

Your Explanation is probably the best. Don't stop making programming videos. Love it.

[@AlgosWithMichael]

Thanks, will do!

[@agamarora7906]

@@AlgosWithMichael Can you make please videos for these questions (1703)Minimum Adjacent Swaps for K Consecutive Ones, (1896)Minimum Cost to Change the Final Value of Expression and (564)Find the Closest Palindrome

[@kapilrules]

You are the best man. the way you simplify things I became your huge fan

[@juliahuanlingtong6757]

crystal clear explanation!!! Aboslutely love it! Although if we use preorder instead of postorder, it seems to improve the performance a lot( If hit, terminate recurisve immediately, rather than go left and righ, and then itself).

[@baurks]

Michael - thanks so much for these videos. You put me at ease.

[@montuedge]

Superb explaination

[@AlgosWithMichael]

Thanks :)

[@valentinmorales2633]

Amazing explanation man!

[@gaganharjai3387]

thanks for your clean explanations. It fails for cases where we have p and q same, like 101 24 48 15 -1 26 39 28 37 38 4 33 -1 -1 32 34 6 10 -1 43 -1 -1 2 -1 47 17 23 7 41 36 -1 8 -1 -1 44 -1 -1 13 16 18 27 29 -1 -1 42 -1 3 11 -1 -1 -1 25 19 46 -1 -1 -1 22 14 -1 20 49 35 -1 -1 1 -1 -1 5 -1 12 -1 -1 -1 -1 -1 -1 9 -1 -1 30 -1 -1 21 -1 -1 -1 50 40 -1 -1 -1 -1 -1 -1 -1 31 -1 -1 45 -1 -1 43 43

[@geekySRM]

This was awesome.

[@geekySRM]

Subbed! ❤️

[@priyaarya9354]

really nice explanation

[@AlgosWithMichael]

Thank you

[@zhenliu4779]

God-Like coder

[@kumarc4853]

Thank you

[@AlgosWithMichael]

Anytime!

[@kumarc4853]

@@AlgosWithMichael hey Michael can you pls also provide ways of thinking, how to approach a problem if you have never seen it before. sort of a toolkit to apply on problems or how to work through examples and come up with an approach

[@montuedge]

@5:30 lets code it