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.
Constraints
1. Time complexity -> O(n) 2. Space complexity -> constant
Format
Input
Input is managed for you
Output
Output is managed for you
Example
Sample Input
11
1 2 3 4 5 6 7 8 9 10 11
3
100
200
Sample 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
Question Video