Tap here to switch tabs
Problem
Submissions

Problem: Reverse Nodes in k-Group

Reverse Nodes in k-Group rearranges a linked list by reversing each complete group of k nodes, leaving leftovers in order without changing values and using constant extra space.

Statement

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.

Constraints:

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

  • 1≤1 \leq k ≤\leq n ≤500\leq 500
  • 0≤0 \leq Node.value ≤1000\leq 1000
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Reverse Nodes in k-Group

Reverse Nodes in k-Group rearranges a linked list by reversing each complete group of k nodes, leaving leftovers in order without changing values and using constant extra space.

Statement

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.

Constraints:

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

  • 1≤1 \leq k ≤\leq n ≤500\leq 500
  • 0≤0 \leq Node.value ≤1000\leq 1000