Linked List Cycle 2 (LeetCode 142) | Full solution with mathematical proof | Study Algorithms

[@shraddhajain8935]

Thanks a lot for such a detailed, simplified, and perfect explanation. I wish this will reach to max students.

[@nikoo28]

Thanks for all the support

[@curiousnerd2253]

Oh my god! Why is your solution not the most viewed solution?!. Just amazing! Thank you so much!

[@nikoo28]

You're welcome!

[@jayachandranpm3981]

A teacher deserves the highest appreciation in the world.

[@techtuber1344]

best explanation buddy , you got my sub:)

[@nikoo28]

Thanks for the sub! 😄

[@jaydeepvasoya6243]

mathematical explanation is super...!! thanks a lot..!

[@astonvaz2247]

Very well explained. Had seen the solution about moving fast pointer to head but couldn't agree, but now after watching the visual explanation, I'm very clear.
Thanks again buddy. 👍

[@SkipperPlaysYT]

what a question and what an explaination!!!

[@CHANDUMEGHANADEVI]

very very useful lectures sir..Thank you soo much for efforts in making such a clear and useful content..videos

[@IshaZaka]

@nikoo28 pk make more videos, your way of teaching and solutions are so good

[@oLittleFive]

Thanks for the detailed explanation! I have a question: Why is (n2 - 2n1) always a positive integer? Can it be negative?

[@susmitapatil4847]

Very good teacher he is. He explains every concept very well. keep doing good work. Thanks for providing such content for free

[@nikoo28]

Thanks a ton

[@AadeshKulkarni]

This mathematical proof is so beautifully explained! I'm loving it baba!

[@nikoo28]

Happy to hear that!

[@azharsofi2854]

Your art of teaching is amazing

[@Unknown373d]

bro is underrated, he deserve large following

[@darkexodus6404]

Brilliant explanation!!

[@hieua3137]

Great Explanation !!!!

[@Salah-YT]

👍😍😎...

[@darkexodus6404]

@nikoo28 At 14:22 Why only slow pointer? Why not fast pointer?

[@rakheesharma7994]

Because slow pointer is advancing one node at a time and fast is jumping two nodes. Hence we use the movement of slow pointer to get the length.

[@paparika567]

no bro you can take slow pointer as well

[@AzharKhan-e9m]

you can take slow as well but make sure that fast also go only one step like fast=fast.next just as head=head.next beacoz distance is same by mathematical proofs so take as u need

[@umtropaqualquer]

Thanks for the explanation! was able to understand the logic behind it!

[@tias9719]

Simplified explaination 👍🏻 Can you please suggest any book to study detailed data structures?

[@nikoo28]

I have links to some books in the video description. Check them out 🙂

[@tias9719]

@@nikoo28 noted. Thanks

[@mubeenakabeer6850]

good explanation

[@AzharKhan-e9m]

new subscriber

[@Unknown373d]

great

[@kartikluthra6621]

🙇🏻‍♂

[@AramManukyan-r5e]

perfect content!!!

[@srikanthchebrolu1091]

💌

[@gauravsharma5584]

isnt floyd warshall graph algorithm ??

[@HRUSHIKESHSHELAR-r9b]

Hitting that subbscribe button as hard as I can.

[@Walid-Sahab]

Love from Pakistan ❤

[@adityaa2303]

good explanation sir

[@yixiangzhang2834]

very well explained.

[@Walid-Sahab]

what an explanation ❤

[@infinite639]

Very Nice bro

[@RasulRasulzade-q6l]

Great content!

[@smitdumore1064]

great explanation

[@nikoo28]

glad you liked it

[@manjarijha7755]

Thanks

[@kashishjaiswal9303]

tysmm...i wasnt able to understand any solution for this on yt until i saw your vid sir!!😭😭

[@BhavanaHemaSree]

sir second approach is not fine when the loop starts ate head

[@nikoo28]

can you please elaborate?