Reverse a Singly Linked List in Java | Leetcode #206 | Data Structures & Algorithms

Took so much time to understand this, but finally. Thanks Dinesh

YOU ARE BEST !!!!

Thank you 😊 so much for uploading a playlist of 230 videos for DSA in Java.....
It really means a lot to me...🙏🙏
Ur videos will never be replaced by any fee paid courses....dam sure!!!!!

Thank You Sir❤!

Hi Dinesh,
Have been following your content and I really appreciate the call stacks that you show whenever there is a recursive approach. I would be glad if you can explain the recursive approach to this problem using the call stack.

thank you so much sir, DSA playlist helping me a lot😊

helped thanks

Awesome explaination 🤩......

I got you Bro!! Thanks for sharing your knowledge !!!

Sir, I could see the overloaded method display(ListNode node) not included in source code. Please include, it will be useful.

you use many part of ppt this is understandable any concept thanks you sir give me whole knowledge particular algorithm step by step
❣❣

your tutorial very best

what the hell lol!!! how can someone be so damn good at explaining stuff. Thanks so much! :)

this doesnt produce correct reesults yet is accepted by leetcode

Sir..Can u provide source code for this code... Seperately. In github link of urs... It's all merged. So please provide me a source code for this reverse a singly Linked List Code. Thanks

Simply superb. I struggled to understand this concept even after seeing other animated code. Its crystal clear now. Thank You Techie. Long Live :) :)

very good demo thank you

private ListNode head change to private static ListNode head; your code will work smoothly and in display parameter write ListNode head.. nice videos sir i am Following it daily ❤️😊👏

I did not get how are we displaying the list, because. display is taking head, but in source code, we just have a display method without any parameters. Can someone help?

thank god i found something good !!

here display method void it doesnot take any parameters till your last videos
can you pls send the code to me.i have little bit confusion in the demonstration of this

Very nice explaination sir 👍🏻 Thank you

Thank you! I finally got it! Spend a lot of time trying to understand the logic. Your example is brilliant! We basically reverse every link back to the previous element!

Actually I created the linked list from your video then when using the reverse code it is not working as i guess you have made some changes in main method while calling the reverse method

Why your code is not working

Thank you sir!

Thank you very much sir for your wonderful videos, it helped me a lot

Sir can you make a video on this question :--

Reverse a Linked List in groups of given size.

Dinesh Sir capgemini ,tcs,accenture inke coding rounds questions kaise solve karte hey ...make videos on that it will be helpful for us

Excellent work sir

don't know why your videos are so underrated, the explanation is simply amazing👌👌

Sir can you Please make a video on reverse linked list in group of K

Thank you,Sir. You are a saviour.

explanations another level ty :)

Sir actually the head still points to the first node even after reversing it.. is it normal??
because when i apply the length() method it shows the length to be 1 if i reverse the list.
need help sir!

But sir i am facing an error like can't make a static reference to non static field head

Thank you for making this concept so much easier!

thank you sir!!

Damn, your animations are super cool which makes learning truly understandably!

Very simple and nice demonstration. Thank you very much for this awesome video. : )

modular banake dikhao single clss me nahi

thanks for your good explanation in a simple way sir,
lots of love from nepal

Great representation! VERY RARE TO FIND!

sir why this display method contains parameter(arguments) now, as in previous lectures it is not!!!!
sir, when to use and when not to?????

sir how to remember all the codes and algorithms.. please give your opinion about this... Please sir 🙏

Why are we returning previous? Also why are we passing the head node while calling the function?