K Reverse In Linked List

easy
1. You are given a partially written LinkedList class.
2. You are required to complete the body of kReverse function. The function is expected to tweak the list such that all groups of k elements in the list get reversed and linked. If the last set has less than k elements, leave it as it is (don't reverse).
3. Input and Output is managed for you. 

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

1. Time complexity -> O(n)
2. Space complexity -> constant

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
11
1 2 3 4 5 6 7 8 9 10 11
3
100
200
Output
1 2 3 4 5 6 7 8 9 10 11 
3 2 1 6 5 4 9 8 7 10 11 
100 3 2 1 6 5 4 9 8 7 10 11 200 
Previous
Odd Even Linked List
Next
Display Reverse (recursive) - Linked List

Related Questions