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

Problem Link: tinyurl.com/3r...
Entire LL Sheet: takeuforward.o...
Check our A2Z DSA Course: takeuforward.o...
Please do give us a like, and subscribe to us if you are new to our channel.
Do follow us on our socials: linktr.ee/take...

[@md.ualiurrahmanrahat2400]

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!

[@sakshammisra189]

bro , i am with you in all of your debate , still he is earning heavily due to yt , maybe not particularly this video with 53k views at this point but he has videos with million views too

[@md.ualiurrahmanrahat2400]

@@sakshammisra189 Yes. But he is not only earning money. He is earning prayers and blessings of millions of students like us. He is helping even foreign countries students as you won't see much videos from them. Indian KZbinrs took teaching to the next level through KZbin.Thousands of us will get inspired to contribute like him when we become successful and have the opportunity. That's how he is shaping our minds.

[@priyanshugupta7840]

@@sakshammisra189 Atleast, he is redeeming what he earns with his efforts and generosity

[@kamalakannanng4206]

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

[@bishalkundu7592]

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

[@adarshjhanitkurukshetra]

Whole NIT and IIT follows you ♥, hats off

[@AdityaGupta-cx1ej]

Bro I am in IIIT-Kottayam we also follow not just IIT and Nit🙂

[@frouMagician]

@@AdityaGupta-cx1ej well, he did not say "only" NITs and IITs follow him, did he ?

[@divyatejaswinivengada6368]

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

[@_CodeLifeChronicles_]

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

[@WorstinJava]

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

[@aryanpinto5105]

The intuition part!🤌💯

[@arzooqureshi8821]

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

[@mananshah3248]

10:15 You don't need to do the whole odd even thing. Just think of relative velocity - it's 2-1 = 1. Since it's an infinite loop, think of slow as just standing still, and fast moving with velocity of 1 relative to slow. Eventually it's gonna round up and reach slow.

[@tusharyadav5874]

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.

[@priyanshugupta7840]

Can you please explain how that works?

[@anuplohar23]

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

[@arielluquer8274]

Awesome video! I was doubting you'd actually explain the intuition in an intuitive way but you did it, thank you!!

[@BarrytheClipper]

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.....

[@hareshnayak7302]

Understood, thanks striver for this amazing video.

[@deepakbhatt03]

This is real teaching!

[@ishantsharma8139]

You are best teacher on KZbin ❤

[@_dion_]

the best explanation on the internet.

[@manishmahajan6094]

What a clarity !!! God level explanation at end

[@qwarlockz8017]

I am having so much fun with your videos. They are so clear and interesting. You are doing a great job!

[@tanya8353]

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

[@harshsingh357]

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

[@SaqibChoudhary09]

Best DSA in YT

[@shamanthhegde2820]

Your at a whole new level

[@aman_deep21]

Great explanation of the intuition ❤

[@AbhijitSahoo-oc2lz]

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

[@shrutishukla6336]

Thankyou Sir for teaching us real problem solving.

[@RajNamdev_19]

Understood very well. I just love the way you teach. Love you Striver Bro ❤ One day or other I will meet you in the Google office or somewhere else and I will thank you personally by hugging you tight Bhai ❤

[@aruna5869]

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

[@Testing-ts4qq]

Thank you ❤❤😊 the intuition part was crazy. Loved it really.

[@TS-oj3vd]

intuition explanation was on point.

[@pritagarwal6389]

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

[@abhinavkumar6344]

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

[@kapilsolanki6844]

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

[@rishabh_pant]

All the best brother 🎉

[@shreyxnsh.14]

how did it go?

[@rahulmandal4007]

@@shreyxnsh.14 It was ok

[@anindyapaul9735]

For which company?​@@rahulmandal4007

[@shivamdeore5556]

Man you are great, simply great!!!

[@franciskp9117]

Man you're a GENIUS !!!

[@PrashantSaxena-e4c]

Easier Solution could be : class Solution { public: bool hasCycle(ListNode *head) { ListNode* temp=head; while(temp!=nullptr){ if(temp->val==1e7){ return true; } temp->val=1e7; temp=temp->next; } return false; } };

[@sarangkumarsingh7901]

Awesome content Sir......

[@SimranChetiwal-uy2xn]

Great Striver🤩🤩

[@mayankshakya9200]

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

[@shreyxnsh.14]

so that means what he said is wrong?

[@shreyxnsh.14]

3,4,5 wont work if the list has just 2 elements

[@mayankshakya9200]

@@shreyxnsh.14 kind of yes or we can say that he hasnt explored about that…

[@tejastrivedi2023]

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

[@manansarraf73]

GOD OF DSA->STRIVER

[@tollytrendzvideos395]

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

[@codingp110]

Awesome Explanation!

[@NonameNoname-f2t]

you are great sir ! loads of love ❤

[@monish0075]

brw there is no videos on string please upload the video it will be very useful for us please upload it Asap

[@gaurishaaaa]

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

[@learning_trespasser]

thanks for telling us the why 😁

[@seeingsee6593]

you are genius i love you thank you so much

[@gautamsaxena4647]

understood bhaiya

[@rahuldwivedi4758]

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

[@VIJAYSHARMA-dh6vo]

instead of using fast->next 2 times you can simply write fast->next->next :)

[@rahuldwivedi4758]

@@VIJAYSHARMA-dh6vo I know :). But my intention was to make it more obvious that fast is taking two steps when slow just takes one. Also I wanted to avoid that extra ugly check in while, ie, && fast->next->next != null (just a personal preference.)

[@krishnakarule3708]

You are the best!!

[@pratyushtripathi1728]

Understood 😊

[@rahuldwivedi4758]

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

[@nrted3877]

Thanks striver

[@hatkereacts]

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+

[@moneeb-ur-rahman7]

Awesome!

[@mananpareek6089]

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; }

[@rockstarCoolz]

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

[@dineshkumarrg4894]

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

[@Learnprogramming-q7f]

Thank you bhaiya

[@NazeerBashaShaik]

Understood, thank you.

[@shubhamchaudhary8688]

Intution - ground mein do ladke bhaag rahe ek dusre se tez hai...aisa koi na koi point to aega hi na jab tez wala ladka dhere wale ko pakad lega.

[@YourCodeVerse]

Understood✅🔥🔥

[@shaiksoofi3741]

thank you

[@NARUTOUZUMAKI-bk4nx]

Understooood

[@DeepakPatel-d5v]

Thanks A Lot

[@codeman3828]

Understood

[@subee128]

Thanks

[@ashishpradhan6250]

underestood

[@YPZanzarukiya]

understand

[@selene8721]

Thank you so much!!

[@hardikpatel352]

understood

[@chinmayraichur8984]

Understood!

[@ArpitPatel-k4s]

Bhaiya itna khatarnak nhi padna h sb dar jaye

[@learning_trespasser]

thanks bro

[@HarshMishra-hp2lt]

Can we also use unordered_set instead of map?

[@XS_01]

bool hasCycle(ListNode *head) { if(head == NULL) return false; ListNode* temp = head; int n = 10000; //given contraint for(int i=0; inext == NULL){ return false; } temp = temp->next; } return true; } big brain move

[@anikesh001-qwe]

❤

[@YashNagaria]

relative motion yaad agaya

[@4everachyut]

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?

[@anindyapaul9735]

See the video completely. U will get to know

[@nehapimpalkar396]

understood!

[@Abhishekthakur-mg4el]

thanks bhai❤

[@YATHARTHBHARDWAJ-y8m]

undersood

[@elco7956]

🐐

[@SunnyKumar-dw9ze]

👍

[@rajputvanrajsinh9527]

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

[@test-nature]

I am struggling with chatgpt why move 1 and why move 2. then I was jump to this video

[@saranshbhole8500]

Wrong Answer 15 / 29 testcases passed Editorial Inputhead =[1,2] pos = -1 Use Testcase Output=true Expected=false the above test case fails to do so what about this condition?

[@peterfromengland8663]

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

[@abhijitjha4409]

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 ?

[@thesumitkumar0]

Time Complexity of this ?

[@MyselfNothing-t5c]

what if it has same elements ?

[@DhineshKaviraaj]

Why not use a set instead of map?

[@iamnoob7593]

US

[@SamyakSharma-oy1bv]

respect++;

[@cenacr007]

us

[@adityaasthana8758]

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???

[@nishantgupta5015]

If we follow, slow by by 1 and fast by 3 the resultant reduction between them will be 2 , and consider if initial b/w tem is 7 the follow will like this 7 - 5 - 3 - 1 - (-1)... No collision of them

[@adityaasthana8758]

Thanks @@nishantgupta5015

[@ManasNandMohan]

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

[@KAMLESHGURJAR-y3z]

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