LeetCode 141: Linked List Cycle - Interview Prep Ep 64

[@MiddleEasternInAmerica]

thank you so much fisher coder, PLEASE don't stop making videos, at least until I get a job :) :)

[@MiddleEasternInAmerica]

can't wait to see your explanation for (24. Swap Nodes in Pairs : leetcode.com/problems/swap-nodes-in-pairs/)

[@pil39]

Thank You for the explanation through each iteration! This is indeed a quality video explanation and gave me a lot of clarity.

[@FisherCoder]

Glad it was helpful!

[@rhuzaifa]

Nice explaination, Thank you.

[@FisherCoder]

You are welcome!

[@seifmamdouh5193]

Great Explanation!

[@FisherCoder]

Glad you think so!

[@ozas5922]

perfect explanation

[@FisherCoder]

Glad it was helpful!

[@melanieprevot4926]

Super clear !! Thanks

[@FisherCoder]

Great to hear! Many thanks!

[@inchworm9311]

You are a great teacher. Thank you

[@FisherCoder]

Thank you! 😃

[@henrywang2516]

It's helpful fo me. Thank you for sharing.

[@FisherCoder]

Glad it was helpful!

[@miadinh6381]

the pictures were very helpful.

[@FisherCoder]

Glad you like them!

[@BlazedOutTurtle]

Bravo ! best explanation on KZbin

[@FisherCoder]

Glad it was helpful!

[@MANIDEEP08]

Superb explanation, Thanks!

[@FisherCoder]

Glad it was helpful!

[@victory4627]

Very nice and clear explanation!! :D

[@FisherCoder]

Glad you liked it!

[@rishabhrai9472]

Absolute clarity man! Thanks for the explanation

[@FisherCoder]

You bet!

[@bhavyashah1775]

Awesome solution!! Easy Explanation.

[@nirajpatil1395]

thank you for explaining it really helpful

[@FisherCoder]

Glad it was helpful!

[@alexandrunknown1456]

your explanation was a best one !

[@FisherCoder]

Glad you liked it

[@ehsanhosseini5861]

As usual great explanation. Love your videos.

[@FisherCoder]

Thank you!

[@alekseiwe]

The best explanation! Thank you dude:)

[@FisherCoder]

Glad it helped!

[@alekseiwe]

@@FisherCoder yes, I understand how it works after you explanations👍🏻

[@HariHaran-sl1pg]

You voice is sweet..Keep going my frd..

[@meerimmoldali416]

thanks so much

[@tenmadoc4622]

Really taught well sir Thankyou !!

[@FisherCoder]

Most welcome!

[@lilyjoy1338]

You are the best teacher in the World...❤️ Plzz keep posting videos and blessing us with ur knowledge

[@FisherCoder]

Thanks a ton!

[@merxgrc9940]

thanks dood keep making these good shit

[@Dstoic]

perfect

[@louischou6780]

Why do we need to check fast != null in the while loop condition? Don't we just need to check if the fast.next != null to ensure the fast node has already arrived at the end of the list?

[@abhinavsharma3819]

O thanks, u cleared my doubt, I think we need to check both fast.next and fast.next.next because maybe the list is not cyclic and it can give an error

[@PankajYadav-nz4gn]

Hey Fisher! Thanks for explaining the code,but I have one doubt and that is what about returning the position of the node where cycle is found. You are not returning the position of the node where the cycle exists.

[@abhinavsharma3819]

Suppose the fast node is at second last position i.e. n-2 , and next of last node is none instead of a cycle, wouldn't fast.next.next would give error since since there is no next to the none ?

[@tushitapatel5782]

how do we know that the slow pointer won't got on another cycle? what is the guarantee that the fast will catch on during slow pointer's first cycle?

[@aba0101]

Hi Steve, your video is greatly helpful! But here in this problem, I'm wondering if we need to check the special circumstance first? Let's say, if(head == null) return false.

[@richmondmensah4408]

Could you also do Linked List Cycle II

[@jenniferou]

how are computer science people so clever 😱

[@yufanma2942]

可以问下学长在哪里工作嘛

[@murike]

Ok, but how do you prove matematically that your pointers will meet eventually and not move in infinite loop? Going through one example is not convincing

[@SHASHANKRUSTAGII]

Not liking as Number of likes = 123 That seems a perfect number.