#Reverse linked list code

We create a new variable nextNode which helps us point to the next node of the current node in each iteration. Now, we create a while loop, we do actual work inside this loop.

#Reverse linked list code

The code in the comment is the definition for a singly linked list, it works as a constructor when we create a new node inside the reverseList function. First, we create a function reverseList which takes one parameter head, then inside this function, we create 2 variables, prev with the value of NULL and the head value is assigned to the curr variable. Once our curr variable reaches the last element of the list, we terminate the loop and return prev.After that, we assign the value of the nextNode to the curr.We assign the value of the curr to the prev variable.Then we assign the next pointer of the curr to the prev.Inside the loop, we need to create a variable nextNode which is assigned to the pointer of the next node after each iteration starting from the head.First, we just need to initialize one pointer, prev to NULL and one another variable curr points to head.The procedure to solve this problem by the iterative method can be constructed as follow: This question can be solved by either iteratively or recursively and we gonna do them both in JavaScript. Given a singly linked list, and you have to reverse it, for example: Input: 1->2->3->4->5->NULL If you want to take a try before we jump into the solution, feel free to redirect this link to do it on LeetCode.

In this article, we will tackle this problem, but first, if you don’t know what is linked list, check this article before we proceed. Happy new year, everyone! On the very first day of 2020, let’s jump to a problem that has been asked all the time during the interview – Reverse A Linked List.