LeetCode 206: Reverse Linked List RECURSIVELY - Interview Prep Ep 60

Показать описание

⭐ Support my channel and connect with me:

LeetCode 206. Reverse Linked List

Reverse a singly linked list.

Example:
Input: [1,2,3,4,5]
Output: [5,4,3,2,1]

Follow up:
A linked list can be reversed either iteratively or recursively. Could you implement both?

Solutions explained (Recursive approach):
1. We'll write a helper function to help us do the recursion which takes the given head node and a newHead node (start with null);
2. Base condition: when head == null, we'll just return newHead;
4. return newHead;

Time: O(n)
Space: O(n)

// TOOLS THAT I USE:

// MY FAVORITE BOOKS:

My ENTIRE Programming Equipment and Computer Science Bookshelf:

And make sure you subscribe to my channel!

Your comments/thoughts/questions/advice will be greatly appreciated!

#softwareengineering #leetcode #algorithms #coding #interview #SDE #SWE #SiliconValley #programming #datastructures

Рекомендации по теме

Комментарии

Dude you converted the iterative logic to recursive approach like a king. I could easily follow this video

sugandhm

i have been watching about this problem by lots of youtuber, but they use recursive function in variable instead of "return" made me confused, you have helped me fully understand this problem.

trunguc

this problem, though easy, is actually quite tricky if you do it the recursive way. I've watched a few other videos where it gives this "if you know you know" vibe without truly explaining why so and how so. This is by far the best and most intuitive way of explaining the recursive solution for this particular question. That being said, for this type of problems, an iterative solution is still easier to understand and yields better space performance.

JimmyCheng