Rotate an array by k positions in place. No extra array should be used.
Problem
rotate array anti clock wise by given position.
**Your Algo check manually by mentors . please make sure your algo full fill question conditions .
INPUT: First line No of Test Case T. then T test Case. First given no of Element of array. Then Element Of array. then Value Of D(Rotation Point) .
Output: Rotated Array.
Time Limit: 5
Memory Limit: 256
Source Limit:
Explanation
Let us take the same example arr[] = [1, 2, 3, 4, 5, 6, 7], d = 2 Rotate arr[] by one 2 times We get [2, 3, 4, 5, 6, 7, 1] after first rotation and [ 3, 4, 5, 6, 7, 1, 2] after second rotation.
