Middle of a Linked List (LeetCode 876) | Full Solution with animations | Study Algorithms

[@abhineveash]

Ultimate explanation ❤

[@jokergotham5865]

The way of explaining is amazing......
infinite likes

[@nikoo28]

glad i could help

[@safar19899]

Explanation is gold! Thank you my good sir!

[@anushka7436]

The way you explain is mind blowing. Keep posting such videos!! Thanks a lot

[@singhshek58]

nice explanation sir i understood now slow and fast pointer method .
Thank you🙂

[@oluwatosin001]

Thank you so much for this explanation and I understood it perfectly

[@samsulalam3848]

very good explanation and thought. thank you sir

[@dhiraj3933]

Explained Perfectly! Thanks

[@deliveringIdeas]

Amazing explanation sir!

[@sakibsyed7626]

Thanks sir for great explanation

[@ymhuang651]

Awesome teaching!

[@nikoo28]

So happy to read this.

[@brinderdhaliwal3570]

Great example

[@avanishraj386]

while loop looks incorrect as you are saying "or" condition but programmed "and" condition. But, I checked further and confused about why does the program fail when worked with "or " condition?

[@nikoo28]

it just means that you need to run the while loop until both fastPtr and fastPtr.next are not null

[@yt_goluyadav]

sir what if the length of LL is bigger?

[@kalyanamvenumadhav2245]

Can we use (slowPtr != null) with remaining conditions in while loop I think this will also work
May I know why you are not adding (slowPtr != null) in while condition.

[@nikoo28]

why do you want to add additional conditions?

[@kalyanamvenumadhav2245]

@@nikoo28 we are moving slow pointer along with fast ptr right then why we are not adding slow pointer

[@dharmeshkase6003]

@@kalyanamvenumadhav2245 fast pointer is moving twice the speed isnt it obvious it will reach null first.