Reverse In Groups Recursive, is a Singly Linked List related problem and in this post we will see how we can solve this challenge in C++

Reverses the Linked List in Groups of K nodes using Recursion Example: Inputs: 1->2->3->4->5->6->7->8->NULL and k = 3 Output: 3->2->1->6->5->4->8->7->NULL.

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas