# Reverse DLL nodes in groups

Posted: 2 Dec, 2020
Difficulty: Moderate

## PROBLEM STATEMENT

#### You are given a Doubly Linked List of integers and a positive integer 'K' representing the group size. Modify the linked list by reversing every group of 'K' nodes in the linked list.

``````A doubly linked list is a type of linked list that is bidirectional, that is, it can be traversed in both directions, forward and backward.
``````
###### Note:
``````If the number of nodes in the list or in the last group is less than K, just reverse the remaining nodes.
``````
##### Example:
``````Linked list: 8 9 10 11 12
K: 3

Output: 10 9 8 12 11

We reverse the first K (3) nodes. Now, since the number of nodes remaining in the list (2) is less than K, we just reverse the remaining nodes (11 and 12).
``````
##### Input Format
``````The first line of input contains an integer T, the number of test cases.

The first line of every test case contains the elements of the singly linked list separated by a single space and terminated by -1. Hence, -1 would never be a list element.

The second line of every test case contains the positive integer ‘K’.
``````
##### Output Format:
``````For every test case, print the modified linked list. The elements of the modified list should be single-space separated, terminated by -1.
``````
##### Note:
``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 10
1 <= N <= 5 * 10^4
1 <= K <=  10^5
-10^3 <= data <= 10^3 and data != -1

Time Limit: 1 sec
`````` Approach 1

The idea is very simple. We will process ‘K’ nodes at a time. Firstly, we will reverse the first ‘K’ nodes of the doubly linked list and then we will do this recursively for the remaining linked list.

Algorithm:

• If the node does not exist, simply return ‘NULL’.
• ‘HEAD’ is pointing to the first node of the linked list.
• If there are less than ‘K’ nodes, just reverse them and return the reversed linked list. Else reverse the first ‘K’ nodes of the linked list.
• After reversing the ‘K’ nodes, the head points to the Kth node and the Kth node in the original linked list will become the new head.
• To connect the reversed part with the remaining part of the linked list, update the next of the head to (K + 1)th node and the previous of the (K + 1)th node to the head node.