Monday, 13 February 2017

Geeksforgeeks Solution For " Reversal Algorithm "

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 of N size. The task is to rotate array by d elements where d is less than or equal to N.

Submit Your Solution :- Click Here 


Solution :-

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,d,i,j,res=0;
        cin>>n;
        int arr[n];

        for(i=0;i<n;i++)
        cin>>arr[i];
        cin>>d;
        for(i=d;i<n;i++)
        cout<<arr[i]<<" ";
        for(i=0;i<d;i++)
        cout<<arr[i]<<" ";
        cout<<endl;
        
    }
    return 0;
}



Output:-

Geeksforgeeks Solution For " Reversal Algorithm "

No comments:
Write comments

Recommended Posts × +