Reverse Nodes in k-Group

Try to solve the Reverse Nodes in k-Group problem.


The task is to reverse the nodes in groups of kk in a given linked list, where kk is a positive integer, and at most the length of the linked list. If any remaining nodes are not part of a group of kk, 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 O(1)O(1) extra memory space.


Let n be the number of nodes in a linked list.

  • 11 \leq k \leq n 500\leq 500
  • 00 \leq Node.value 1000\leq 1000


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy