HackerRank - Reverse Linked List | Full solution with visuals | Study Algorithms

[@technicalguy.]

No doubt you're an excellent teacher! ❤

[@Sranju23]

At the end u can just return prevNode without doing head = prevNode... btw nice tutorials 😃

[@ForWork-mj9fv]

Thank you Nikhil, i code in python, buh only your explanations are good enough for me to start trying things out 🙏

[@snehalshelar7778]

Why we cant take only ptr as a new node ...why we need to take 2 new nodes ?

[@chhoturaj-c6u]

great explanation

[@syw512]

Really like your explanation!! I’m new to programming,you make it really easy for beginners to understand. 👍👍👍

[@nikoo28]

Glad I can help you out

[@syw512]

@@nikoo28 looking forward to see more of your videos.

[@kash1903]

Very helpful video thank you bro

[@Abhaykumar-lw7nr]

nice explanation thanks man

[@TarunSharma-eg7kl]

Great explanation!

[@reactninja6567]

thanks a lot ! This was easy to understand.I took a udemy course on dsa But they don't teach with diagrams like you do. Please if you any paid subscription let me know i would buy for sure. Also if possible can u suggest some good resources(books or courses) which are more diagram oriented rather than just running a code .

[@nikoo28]

Thank you so much for your feedback and motivation. Right now all my content is only on KZbin and the website. Sure, if I add more subscription based course, you will know about it.

[@reactninja6567]

@@nikoo28cool! any visual based learning for DSA book/course.can u refer? that would be much helpful.

[@Unknown373d]

nice explanation

[@xtremeinnovations8599]

Thanks!

[@pavanshanmukh6502]

Thank you for your wonderful explanation

[@nikoo28]

You are welcome!

[@KeerthiNarayan-c4o]

I'm stuck in last iteration you skipped that part please explain 12:09

[@nikoo28]

in the last part, we are just reallocating the head, such that the linked list is actually reversed. Follow the pointers and you will understand.

[@riyapawar4569]

Great ❤❤ too good

[@sushant3530]

great

[@johncho9160]

why do you have to initialize the reversedList with Integer.MIN_VALUE? the value we assign does not matter since we are returning reversedList.next at the end anyway?

[@nikoo28]

you are correct...it is just a dummy node. You can assign any value to it. It is just for utility.

[@sukhkaur444]

I don't understand the swapping of the pointers☹ I watched the video over and over, still don't get it.

[@nikoo28]

What part are you facing a problem with?

[@MaulikDodiaHollywoodMovieLover]

currNode.next = preNode; ----> Is this statement only assign preNode's value to currNode's next node which is 8. and If this statement is assigning values then how ListNode nextNode = currNode.next; ---> this statement giving us next node. Confusing!

[@nikoo28]

did you go over the explanation part or went straight to the code?

[@MaulikDodiaHollywoodMovieLover]

@@nikoo28 Yes, I watched it. Didn't get so I asked! Never mind.