Skip to content
Related Articles

Related Articles

Java Program For Reversing A Linked List In Groups Of Given Size- Set 2

View Discussion
Improve Article
Save Article
  • Last Updated : 11 Jan, 2022

Given a linked list, write a function to reverse every k nodes (where k is an input to the function). 

Input: 1->2->3->4->5->6->7->8->NULL and k = 3 
Output: 3->2->1->6->5->4->8->7->NULL. 

Input: 1->2->3->4->5->6->7->8->NULL and k = 5
Output: 5->4->3->2->1->8->7->6->NULL.

We have already discussed its solution in below post 
Reverse a Linked List in groups of given size | Set 1
In this post, we have used a stack which will store the nodes of the given linked list. Firstly, push the k elements of the linked list in the stack. Now pop elements one by one and keep track of the previously popped node. Point the next pointer of prev node to top element of stack. Repeat this process, until NULL is reached.
This algorithm uses O(k) extra space.


// Java program to reverse a linked list 
// in groups of given size 
import java.util.*;
class GfG 
    // Link list node 
    static class Node 
        int data; 
        Node next; 
    static Node head = null;
    /* Reverses the linked list in groups 
       of size k and returns the pointer 
       to the new head node. */
    static Node Reverse(Node head, int k) 
        // Create a stack of Node* 
        Stack<Node> mystack = 
                    new Stack<Node> (); 
        Node current = head; 
        Node prev = null
        while (current != null)
            // Terminate the loop whichever 
            // comes first either current == NULL 
            // or count >= k 
            int count = 0
            while (current != null && count < k)
                current =; 
            // Now pop the elements of stack 
            // one by one 
            while (mystack.size() > 0
                // If final list has not been 
                // started yet. 
                if (prev == null)
                    prev = mystack.peek(); 
                    head = prev; 
           = mystack.peek(); 
                    prev =; 
        // Next of last element will point
        // to NULL. = null
        return head; 
    // Function to push a node 
    static void push( int new_data) 
        // Allocate node 
        Node new_node = new Node(); 
        // Put in the data = new_data; 
        // Link the old list off the 
        // new node = head; 
        // Move the head to point to 
        // the new node 
        head = new_node; 
    // Function to print linked list 
    static void printList(Node node) 
        while (node != null
            System.out.print( + " "); 
            node =; 
    // Driver code
    public static void main(String[] args) 
        // Start with the empty list 
        //Node head = null; 
        /* Created Linked list is 
           1->2->3->4->5->6->7->8->9 */
        push( 9); 
        push( 8); 
        push( 7); 
        push( 6); 
        push( 5); 
        push( 1); 
               "Given linked list "); 
        head = Reverse(head, 3);
               "Reversed Linked list "); 
// This code is contributed by Prerna Saini


Given Linked List
1 2 3 4 5 6 7 8 9 
Reversed list
3 2 1 6 5 4 9 8 7

Please refer complete article on Reverse a Linked List in groups of given size | Set 2 for more details!

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!