Palindrome Linked List (LeetCode 234) | Full solution with trick | Study Algorithms

[@dupladupa-gl8lo]

bro trust me u r a god level teacher bro omg

[@sameerkumarsingh8942]

i dont but i get a lot of clarity from your videos , Thanks a lot

[@hunorvadasz-perhat6001]

Good explanation! Thank you for the great video 😃

[@nikoo28]

thank you for subscribing.. :)

[@poojakasar4572]

explanation is awesome💥💥👍

[@matthewzarate8851]

Loved the explanation for both implementations! Thanks Nikhil!

[@honey-xr5kp]

Love your videos! Very well explained. When I tried this code though, I received a time limit exceeded error. I'm sure its on my end, but I'm not sure why because as far as I know its the same code and should work.

[@nikoo28]

try the code available on github (link in description)

[@HemaSanthoshiAkula]

such a clean explanation, i loved it

[@infinite639]

Why not using collection linkedlist of java Why we are making our own linkedlist ? Why we are making our own tree? Please answer

[@bhumikabansal6022]

your all explanations are awesome

[@nikoo28]

Thank you so much 😀

[@Hello-l3i]

i am not getting ,what if the no.of nodes is odd ???pls explain

[@deeptigarg799]

When we are doing fast = head and traversed fast to null then why head is not null. Aren't we dealing with the address?

[@shubhamgupta8248]

Not able to understand why i am getting an error when i write while(fast!=null) { if(fast.val!=slow.val) { return false; }

[@nikoo28]

compare to the code I have

[@naruto_6663]

so if this answer matters if we write fast != null we will see we have not breaked the linked list in two there is still connection between the 7->2 so that will not be null thats why we write slow != null as slow pointer will point to null 7->null (after the reverse of the list):)

[@indrajith2002]

bro but for odd testcase it doesnt work .lets say we have a testcase 1->2->3->2->1->null according to you slow points to middle 3 , now if we reverse it will become 1->2->3->null ,where fast points to starting 1 .now if start comparing values @ fast and slow upto 2 it will be same after that slow points to 3 but fast points to null .so what to do?

[@nikoo28]

It does work, did you try with such a case?

[@bhavishyathota6160]

ok,but what's in case of linkedlist of odd length?

[@nikoo28]

The middle element does not matter. 1 4 x 4 1 The middle element x could be anything

[@AlgoXperience]

i love it

[@121sarthkumar4]

when we do fast= head does it start from for head of ex 237732 this value or is it half

[@nikoo28]

Can you please elaborate on your example?

[@appikeeru5785]

Y in his videos very less viewers😢

[@rezowanamehjabinlorel1428]

Please make more explanation videos

[@nikoo28]

Will do..new video every week 😄 Please share as much possible too 😎

[@padmajab2294]

Nice explanation

[@cautioni]

please do a longest palindrome in a linked list

[@nikoo28]

Will add it to my pipeline of video

[@alihaiderzada423]

The stack solution does not work if the pattern is 2 - 3 - 7 - 3 - 2. even tho it is a palindrome

[@bhumikabansal6022]

go with the optimized one

[@SaumyaSharma007]

Hello, what you can do: Traverse entire L. List. (Let Length of LList come out be n) Just push n/2 elements in the stack. Now you can check if n is odd which is your case. Curr will be pointing to -7. So Curr = Curr-> next; Now start comparing left-out L list with stack elements. If n was even. Eg 2 -3 -3 2 Then We would have done nothing. Coz We have already pushed n/2 elements. And Curr will be pointing to the Third element. Now start comparing left-out L list with stack elements. Hope it helps. 😄

[@alihaiderzada423]

@@SaumyaSharma007 awesome thanks buddy i will give it ago.. :)