He has expained the concept the best way. others were confusing . I am talking about whole of Internet. I want to know why one person has disliked the video.
I finally understood the recursive solution after watching your video. In one sentence: the sub-problem is setting the next node's next the current node, and then setting the current node's next to null.
Finally! This is what I needed. Thank you so much. I used to think, once 5 is returned by last fn call, ie reverseList(4) why can't we do head.next = node. But that'd only result in [5,4], [5,3],etc for each call. Even if I make it work, which is possible. By the end of all calls, I will not have the new head of the reversedList altho the list might be reversed. This video helped me understand that we are return 5 all the way back to the first call. That is the gotcha for this algo in my opinion.
Grand job, thanks. The visualisation of the logic in Powerpoint really helps, but for me it was the crystal clear explanation of what node->next->next = node (to use the C++ syntax) is doing, a line of code that seems mystifying at first, that really clinched it.
I'm very new to linked lists and recursion, but returning the new Head value recursively through all the nodes seems pretty wasteful/inefficient. Surely the whole point of a linked list is that a middle node, say node3, does not need to be concerned with where the list starts or ends? I did it the same way because the question said to do it recursively. But, in the real world, would you determine the new Head iteratively? This would simplify the recursive method and it seems to me like it would make the code run a bit faster. Would it? Or is it better to stick all of the functionality in one place and do everything recursively?
recurssion does the work only on its way back....while linked list being manipulated we are also doing the return of new head with it....complexity may be at 2n which is just O(n) (which is also for a iteration)
Hi Jesse, Could you please share the book name and writer name which you referred while uploading the videos for Exam 70-483. I love those videos and going through them and will soon give the exam. Thank You So Much for all your videos.
hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question. Thanks in advance
I also spent all-day digging through materials. even try to trace every step in my code and I am still confused until this video. 10:30 - 10:40 is all I need...I think 99% of people just pretend they understand this simple algorithm that is why they can't really explain it.
@@mobiledeveloper6068 hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question.
@@iam_tigress hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question.
hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question.
Finally I understand the recursive method with this video after I spent a whole day digging through tons of other learning materials on the web.
The animation is a super clean explanation to the `node-->next->next` confusion!! Big thanks mate.
This is the best reverse linked list in recursive tutorial I've ever seen.
truly underrated video...explains recursion clearly
This is a very articulate explanation, thanks Jesse. Making something look so simple is an art.
Finally understood the recursive approach. Thanks a lot
I feel relieved after what your explanation. Thank you!
this is the best so far on recursion, thanks a lot buddy. Very intuitive.
excellent. the tricky part for me was understanding node.next, but this video cleared it up
Thanks for spending extra time explaining node.next.next = node. I really appreciated you breaking it down! Thanks again.
Love you bro ❤️❤️, after wasting 3hrs i finally understand how this Work.
I like your explanations before implementing the algorithms
The best explanation! I wish all linkedList problems are solved like that! You're the best Thank you
Very good explanation of all the algorithms episodes. Thank you! Next would be welcome.
He has expained the concept the best way. others were confusing . I am talking about whole of Internet. I want to know why one person has disliked the video.
The detail and clarity in this video was perfect!
Oh my god. This is actually the best explanation of any algorithm I think I have ever seen. You should really do more!
I finally understood the recursive solution after watching your video. In one sentence: the sub-problem is setting the next node's next the current node, and then setting the current node's next to null.
thank you so much! saw tons of videos on net, still no use. after hours & hours of finding found it!
I saw many explanations but this is my favorite 🙌
Explained amazingly 👏
Thank you for this; all lighted up @ 9:25
This is a very good video! Really helped me to understand!
Loud and Clear! Thanks for the explanation!
Damn this is the only video that explains the whole thing!! Thank You Man!
Absolutely Brilliant! Keep making these videos Jesse!
The best explanation is here. I can guarantee that student will have no fear of recursion after watching this love ❣️from my side.
Perfect explanation! Finally understood reversing a linked list, thank you!
Thank you brother... I have cleared my doubt through this video.. 🙃
Finally! This is what I needed. Thank you so much.
I used to think, once 5 is returned by last fn call, ie reverseList(4) why can't we do head.next = node. But that'd only result in [5,4], [5,3],etc for each call. Even if I make it work, which is possible. By the end of all calls, I will not have the new head of the reversedList altho the list might be reversed.
This video helped me understand that we are return 5 all the way back to the first call. That is the gotcha for this algo in my opinion.
This is the only video that made sense to me. Thanks so much!
That is an amazing explanation.
Excellent video!!!
thnx a lot :)) finally i got this recursion !!!!!!!!
Grand job, thanks. The visualisation of the logic in Powerpoint really helps, but for me it was the crystal clear explanation of what node->next->next = node (to use the C++ syntax) is doing, a line of code that seems mystifying at first, that really clinched it.
really nice visualization !!!!
amazing explanation !
Thanks for sharing, what a fantastic job you did!
Your video is very helpful
Very helpful. Thank you
Hey Jesse, just wondering if your planning on releasing anymore videos or courses, as they are incredibly helpful, thanks for the great content.
THANK YOU. I didnt understand that it returns five to the previous caller, I didnt even know that was a thing.
THANK YOU.....it was really helpful
Excellent!
Thank you a lot!
Nice!
I appreciate!
Thanks! 🙏
Subscribed
Thanks!
Ladies and Gentlemen, now that's how you explain reversing a linked list using recursion
OMG ur legend!
Thanks much
thanks
I'm very new to linked lists and recursion, but returning the new Head value recursively through all the nodes seems pretty wasteful/inefficient. Surely the whole point of a linked list is that a middle node, say node3, does not need to be concerned with where the list starts or ends?
I did it the same way because the question said to do it recursively. But, in the real world, would you determine the new Head iteratively? This would simplify the recursive method and it seems to me like it would make the code run a bit faster. Would it? Or is it better to stick all of the functionality in one place and do everything recursively?
recurssion does the work only on its way back....while linked list being manipulated we are also doing the return of new head with it....complexity may be at 2n which is just O(n) (which is also for a iteration)
thx
You Should Do a tutorial on Linq and LinqPad
For the algo
Hi Jesse,
Could you please share the book name and writer name which you referred while uploading the videos for Exam 70-483. I love those videos and going through them and will soon give the exam.
Thank You So Much for all your videos.
Hi sir I have questions : how can we declare a delegate for an overloaded method
hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question. Thanks in advance
Jesse, Jesse, we have to cook, ah I mean code
😀
Are you goin to complet Exam 70-483: Programming with C# series ?
not clear explanation
Finally I understand the recursive method with this video after I spent a whole day digging through tons of other learning materials on the web.
same here!! I watched videos until I found this gold right here! I GOT IT NOW. Thank you Jesse!!!
I also spent all-day digging through materials. even try to trace every step in my code and I am still confused until this video. 10:30 - 10:40 is all I need...I think 99% of people just pretend they understand this simple algorithm that is why they can't really explain it.
@@mobiledeveloper6068 hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question.
@@iam_tigress hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question.
hey I understood most of the part but I am really confused how the 5 remains in the variable head. For example: head = reverse(node.next); node.next.next = node, node.next = null, return head. The caller when reached 5 it returned 5 now the head variable has the value 5 when the caller returned back to 4 but when the caller returned back to 3 why not the head value is updated with 4?? Hope you got my question.