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?
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 ?
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.
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.
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
thank you so much fisher coder, PLEASE don't stop making videos, at least until I get a job :) :)
can't wait to see your explanation for (24. Swap Nodes in Pairs : leetcode.com/problems/swap-nodes-in-pairs/)
Thank You for the explanation through each iteration! This is indeed a quality video explanation and gave me a lot of clarity.
Glad it was helpful!
Nice explaination, Thank you.
You are welcome!
Great Explanation!
Glad you think so!
perfect explanation
Glad it was helpful!
You are a great teacher.
Thank you
Thank you! 😃
the pictures were very helpful.
Glad you like them!
It's helpful fo me. Thank you for sharing.
Glad it was helpful!
Bravo ! best explanation on TH-cam
Glad it was helpful!
Super clear !! Thanks
Great to hear! Many thanks!
Very nice and clear explanation!! :D
Glad you liked it!
You are the best teacher in the World...❤️
Plzz keep posting videos and blessing us with ur knowledge
Thanks a ton!
Absolute clarity man! Thanks for the explanation
You bet!
thank you for explaining it really helpful
Glad it was helpful!
your explanation was a best one !
Glad you liked it
Superb explanation,
Thanks!
Glad it was helpful!
As usual great explanation. Love your videos.
Thank you!
The best explanation! Thank you dude:)
Glad it helped!
@@FisherCoder yes, I understand how it works after you explanations👍🏻
Awesome solution!! Easy Explanation.
You voice is sweet..Keep going my frd..
Really taught well sir Thankyou !!
Most welcome!
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?
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
thanks dood keep making these good shit
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 ?
thanks so much
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.
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?
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.
perfect
Could you also do Linked List Cycle II
how are computer science people so clever 😱
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
可以问下学长在哪里工作嘛
Not liking as Number of likes = 123
That seems a perfect number.