25. Reverse Nodes in k-Group

[pshivesh8]

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is. You may not alter the values in the list's nodes, only nodes themselves may be changed.

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

[pshivesh8]

I want to solve this in C++, Please assign this issue to me as a part of hacktoberfest-2021

[piyushsharma220699]

@pshivesh8 Assigned in C++