Javascript Program For Reversing A Linked List In Groups Of Given Size- Set 2

Given a linked list, write a function to reverse every k nodes (where k is an input to the function). 

Examples:

Input: 1->2->3->4->5->6->7->8->NULL and k = 3 
Output: 3->2->1->6->5->4->8->7->NULL. 

Input: 1->2->3->4->5->6->7->8->NULL and k = 5
Output: 5->4->3->2->1->8->7->6->NULL.

We have already discussed its solution in below post 
Reverse a Linked List in groups of given size | Set 1

In this post, we have used a stack which will store the nodes of the given linked list. Firstly, push the k elements of the linked list in the stack. Now pop elements one by one and keep track of the previously popped node. Point the next pointer of prev node to top element of stack. Repeat this process, until NULL is reached.
This algorithm uses O(k) extra space.

Given linked list 
1
2
3
4
5
6
7
8
9
Reversed Linked list
3
2
1
6
5
4
9
8
7

Please refer complete article on Reverse a Linked List in groups of given size | Set 2 for more details!