L14. Detect a loop or cycle in LinkedList | With proof and Intuition 

No one even in paid courses also give the intuition behind the algorithms like you did Sir. You could have earned millions by paid courses but instead you chose to contribute for the greater well of the society. Hats off!

Whole NIT and IIT follows you ♥, hats off

Knew this algorithm but came here to learn the proof ❤ And guess what Striver Bhaiyaa never disappoints ❤

The whole video is 10/10 but the intuition part is 1000/10. Just Striver things 🔥

I am so glad i found this channel.The Best!

Hands down the best explanation I have seen in so many year's , I am forever grateful for such beautiful intuition and explanation

The intuition part!🤌💯

the best dsa course. i can code myself after the intuition.explanaton is crystal clear

This is real teaching!

Hi, Remember one thing slow and fast pointer will always meet if the ratio b/w speed of slow and fast pointer is greater than 1. There ratio can be in decimal also , But if you want them to meet fast in the loop then optimal speed will be slow = 1 and fast = 2. But if the two pointers move like slow = 3 and fast = 5 then they also meet. It will take multiple cyle but they will eventually meet.

Bro , i write my own bro by seeing your explanation ❤️ You are my God bro 🫂

the best explanation on the internet.

big hats off for the intuition part!!!🙌❤❤

Many many Thanks for your effort Bhaiyaa ❤ you are in those teacher's of my life which i can never forger in my life❤💯

Man you're a GENIUS !!!

Understood, thanks striver for this amazing video.

Wonderful explanation striver!!! You are really doing an incredible job!!

18:25 That's the reason why I preferred Striver's DSA playlist

Best DSA in YT

Striver bhaiya linked list ki sbhi videos jldi se upload kr do , next month interview bhi h😇

Thankyou Sir for teaching us real problem solving.

🙌 Loved the way you explained the problem solution and intuition . Thank you very much .

you are great sir ! loads of love ❤

Great Striver🤩🤩

Awesome Explanation!

Understood, thank you.

Awesome content Sir......

A great explanation bro....... ❤

very well explained Dek raha ha Binod Kitna easy hota ha DSA.....

Understood 😊

Thank you bhaiya

You are the best!!

thanks for telling us the why 😁

Thank you so much!!

Understood✅🔥🔥

great way to explain why fast and slow ptointers will collide definitely..🙅

Thanks

Thanks striver

thanks bhai❤

wish i could give you 1000 likes at once. Great explaination.

Thanks A Lot

thank you

thanks bro

Understood 😇

If you still confused in H T approach then Imagine, the distance between Hare and Tortoise is 5m. So according to logic we move Tortoise by 1, the distance will be 5m and Hare by 2. So them the overall distance will be 6-2 =4m Our distance got reduced by 4m And if you keep continuing the approach eventually our distance will be zero And the same approach might work in 3. Bit it's depend on luck Like 5+1 = 6. Then 6-3 = 3m Again, 3+1= 4. Them 4-3 = 1m Again, 1-1 = 2. Them 2-3 = -1 m Overlapping.....

Understood!

Understood!!

17:44 correction if we move slow by 1 and fast by 2,3,4,5 etc we still collide and get the answer i ve prove it if you want you can increment fast by >=2 by having the appropriate while check

Understooood

understood!

Understood

GOD OF DSA->STRIVER

Or we can also say, if fast->next == slow return true; to optimize by one step.

understood

While putting the condition fast!=NULL should come before fast->next != NULL,if you do vice versa then it will show pointer error

Thank you !🌄

Thx sir ,can u pls bring string playlist sir pls pls pls😅😅 i m excited for it...

👍

Striver only had one issue that could be heard from a few that his lectures are not beginer friendly. Now that's all the past , it is settled. This is BEST content to exist for all the STRIVERS out there to learn dsa period.! No matter how much dsa u have done earlier even if u r a beginer the A2Z sheet is hands down the best+

Is it necessary to increase the fast pointer only by 2? What if we increased it by 3 or 4? Will it still meet the slow pointer?

13:40 will know the intuition behind why slow and fast pointer will meet

Can we also use unordered_set instead of map?

relative motion yaad agaya

underestood

Time Complexity of this ?

what if the length of LL is 1 or 2?? will this code throw a error??

while(fast !=null){ fast = fast->next; fast = fast -> next; slow = slow ->next; If(fast->next == slow) return true; } return false;

undersood

US

Why not use a set instead of map?

More efficient time and space complexity solution bool hasCycle(ListNode *head) { if(head==NULL || head->next==NULL)return false; ListNode*temp=head; while(temp) { if(temp->val==1e8)return true; temp->val=1e8; temp=temp->next; } return false; }

In your old website you given those links but now what you have given in your link is not good videos

When we will move slow by 1 and fast by 3..then also they will collide....Yrr I don't understand why we are moving slow by 1 and fast by 2..pls anyone can help???

ListNode* temp = head; int i = 0; while(temp){ if(temp && temp->val == INT_MAX) return true; temp->val = INT_MAX; temp = temp->next; } return false; Can this be a solution??? can i tell this to the interviwer ?

Your explanation is op 💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥 💥 ❤‍🩹

us

please use some hindi words please so that north indian student understand easily

Understood

US

Understood

Understood

Understood

Understood

Understood

Understood