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

preview_player
Показать описание
The video shows 2 approaches to solve this question in O(M+N) time

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
Рекомендации по теме
Комментарии
Автор

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:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

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

koushik_cse
Автор

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

susheelkumar-lqgy
Автор

another good explanation, I am using python but I still watch your videos. your logic tends to be straight forward

victorhaynes
Автор

The second explanation was simply amazing :)

sreekanthpulicherla
Автор

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

darshilvshah
Автор

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

varanasibindu
Автор

Very Nice Visualization which made whole thing clear.

chaitanyakarthik
Автор

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

Thanks for the video

tvsureshbabu
Автор

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

dhir_tech
Автор

Incredible video, keep up the amazing work! :)

ComputerScienceSimplified
Автор

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?

mohammadyahya
Автор

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

pedrohenriqueleite
Автор

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 ?

ravipratap
Автор

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

himanshibaranwal
Автор

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

pavankumar.m
Автор

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

diabolicfreak