Geeksforgeeks Solution For " Reverse array in groups "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given an array, reverse every sub-array formed by consecutive k elements.

Input:

The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of two lines. The first line of each test case consists of an integer N, where N is the size of array.The second line of each test case contains N space separated integers denoting array elements.The third line of each test case consists of an integer K.

Output:
Corresponding to each test case, in a new line, print the modified array.

Submit Your Solution :- Click Here 

Solution :-

#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,i,j,x,k,l;
        cin>>n;        
        int arr[n];       
        for(i=0;i<n;i++)
        cin>>arr[i];       
        cin>>x;
i=0;
k=n%x;
            while(i<n-k)
            {
                for(j=x+i;j>i;j--)
{
cout<<arr[j-1]<<" ";
}            
i=i+x;
}
for(i=n-1;i>=n-k;i--)
cout<<arr[i]<<" ";
cout<<endl;
    }
    return 0;

}

Output:-