Solution: Reverse Nodes in k-Group
Solution: Reverse Nodes in k-Group asks you to reorder a linked list by reversing each complete group of k nodes, while leaving a shorter final group unchanged and preserving node values in place.
Statement
The task is to reverse the nodes in groups of in a given linked list, where is a positive integer, and at most the length of the linked list. If any remaining nodes are not part of a group of , they should remain in their original order.
It is not allowed to change the values of the nodes in the linked list. Only the order of the nodes can be modified.
Note: Use only extra memory space.
Constraints:
Let n be the number of nodes in a linked list.
-
kn