Reverse Nodes in k-Group

hard

Acceptance: 43%

Linked List

Given the head of a singly linked list and a positive integer k, reverse the order of every consecutive group of k nodes. If the remaining nodes at the tail number fewer than k, leave them in their original order. Return the modified list.

Examples

Example 1:

Input:head = [10,20,30,40,50], k = 3

Output:[30,20,10,40,50]

Example 2:

Input:head = [10,20,30,40,50], k = 2

Output:[20,10,40,30,50]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Reverse Nodes in k-Group

Examples

Hints

Related Problems