Intersection of Two Linked Lists | Live Coding with Explanation | Leetcode - 160

[@AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure ] : kzbin.info/aero/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure ] : kzbin.info/aero/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ February Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2wrfvII0eZQsPm-MZCmHodm ✅✅✅[ January Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn ✅✅✅[ December Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August Leetcoding Challenge ] : kzbin.info/aero/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅July Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅June Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG ✅✅✅May Leetcoding challenges: kzbin.info/aero/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅Cracking the Coding Interview - Unique String: kzbin.info/aero/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

[@koushik_cse]

Thnak you for clear explanation with visuals. 0:51 Explanation 3:32 Code

[@susheelkumar-lq6gy]

Both approaches were easy to understand but 2nd approch is very concise. Loved your explanation. Thank you 💝 for such a good video.

[@AlgorithmsMadeEasy]

Happy to help!! 😊

[@darshilvshah]

Easy and a simple approach, will definitely recommend this channel to my friends !!

[@AlgorithmsMadeEasy]

Thankyou!!

[@sreekanthpulicherla]

The second explanation was simply amazing :)

[@AlgorithmsMadeEasy]

Thankyou !!

[@chaitanyakarthik3536]

Very Nice Visualization which made whole thing clear.

[@varanasibindu8987]

good explanation, second approach is so simple and explained very well. thankyou

[@tvsureshbabu258]

Though first approch is more intuitive, I liked the second approach Thanks for the video

[@AlgorithmsMadeEasy]

Thanks !! 😊

[@dhir_tech]

Too the point Explained nice vdo ever I hv on utube🤗

[@TechnicalChoraSandeep_Verma]

Thanks Second method is very easy

[@prathamchitransh5338]

Best Explaination ma'am

[@mohammadyahya78]

None on youtube explains this problem better than this video. Thank you. I still though don't get how the circular approach where we exchange nodes will stop as we can keep changing heads forever as I understand?

[@AlgorithmsMadeEasy]

Thank you!! Do not forget to subscribe to the channel!! 😊😊

[@nikitajaiswal9112]

You really made algorithm easy😍🥰

[@AlgorithmsMadeEasy]

Glad you liked it !!

[@ComputerScienceSimplified]

Incredible video, keep up the amazing work! :)

[@AlgorithmsMadeEasy]

Thank you so much!!! 😊😊

[@sakshisharma6765]

Nice explaination :)

[@himanshibaranwal7297]

Is anyone not getting Time Limit Exceeded for the second code?

[@tyagig2923]

What is while(diff>>0)

[@SANCHITJAIN_]

excellent explanation

[@AlgorithmsMadeEasy]

Thanks !!

[@ashokdurunde1814]

thank you for your content

[@pedrohenriqueleite9382]

why use tempA and headA? have possibility of use just one?

[@NAMASTE_PK]

Thank you mam it helps me alot

[@AlgorithmsMadeEasy]

Most welcome!!

[@mohammadasad6044]

very easy thank you very much !

[@chandanpatra3850]

thanks mam

[@AlgorithmsMadeEasy]

Most welcome!!

[@ayeshaadhikari6123]

thank u so much di :)

[@pavankumar.m1341]

I wonder how this works for number 1? it should break loop at when both tempA and tempB has value 1 but moving for 8

[@applecrunch909]

did you figure this out?

[@ravipratap2900]

No bro both 1 is at different memory location both are different so loop will not break nd will move for 8. Now 8 is at same address for both the lists hence will break now.... Read the input explanation carefully it is written there clearly

[@geekaffairs6475]

Good one

[@AlgorithmsMadeEasy]

Thanks !!

[@ravipratap2900]

What if there is only only one node in both the lists pointing to each other for this case loop will continue for infinite....can anyone explain please ?

[@CRamPrasannaCV]

Understood :-)

[@sudharshanchakravarthy7199]

great!

[@AlgorithmsMadeEasy]

Thanks 😊

[@diabolicfreak]

How does the second method not end in an endless loop in the case of no intersection? I dont get it

[@diabolicfreak]

Oh, I get it, both the pointers become null together hence they become equal and break out of the loop

[@sneezygibz6403]

@@diabolicfreak thanks for that lol. I was wondering like hmmm what happens if there's no intersection