Detection of Loop in a Linked List | GeeksforGeeks

Explanation for the article: www.geeksforgeeks.org/write-a-...
Read More: www.geeksforgeeks.org/detect-...
This video is contributed by Pratik Agrawal.

[@acooldryplace00]

Everything GeeksForGeeks creates is coding gold. Thank you for providing subtitles as well.

[@selmabelhadj101]

Great explanation. Thanks a lot

[@anjalirathore6427]

Sir in while(slow and fast and fast.next) ... Why we have used 'and' instead of 'or' . Agar slow ya fast me se ek bhi pointer null pe chla gya matlb list end ho gye. Than or likhne pe ku ni chl rha code?

[@rahulrawathere]

Fantastic explanation... Thanks a lot

[@GeeksforGeeksVideos]

Thanks Rahul :)

[@CalvinJKu]

How do you find out the start node of the loop using the fast/slow pointer method?

[@thelogicalindian2720]

it's a loop there is no starting point!

[@creativegiant148]

Gfg pe ho hii nahi raha same code pe bhi time complexity show kar raha hai

[@tejasukalkar2199]

can we solve it without hash table?

[@MulkRaj101]

And thank you for using Dark Mode!

[@jatinarora941]

Fabulus explanation

[@vijaypandit6590]

Hashtable solution works only if a list has unique elements.

[@ashieshhh]

Not really. They've mentioned they'll store the addresses of the elements not the elements themselves.

[@TheBlackDeath3]

It only works if the key being stored in the hash table is unique, which an address (presumably referring to a memory address) presumably would be. If two "different" nodes have the same memory address then they're not really two different nodes.

[@gibraanjafar1669]

@@TheBlackDeath3 two different nodes won't have the same memory address , I think . Correct me if I am wrong .

[@engulfing_marubozu]

@@gibraanjafar1669 how to make hash table for pointers ? we cant make integer array for doing so

[@ashishsinha8893]

Program to move a node forward n positions plz make videos on this also

[@snehabhusare1146]

Awesome

[@matitiudeforever8155]

nice explaination but i think in while loop statement writing "while fast.next and fast" would be sufficient......correct me if i am wrong

[@dipalisapte9994]

yes, you are right.

[@viralindian8326]

Are you god?

[@tanmesh2820]

bad explaination