Thursday, 6 April 2017

Geeksforgeeks Solution For " Rotation "

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

Problem :- Rotation

Submit Your Solution :- Click Here 

Solution :- 

#include<iostream>
using namespace std;
int Rotation(int [],int ) ;
int main()
 {
 int t,arr[100],i,no ;
 cin>>t ;
 while(t--)
 {
     cin>>no ;
     for(i=0;i<no;i++)
        cin>>arr[i] ;
       
     no=Rotation(arr,no) ;
     cout<<no<<endl ;
 }
 return 0;
}

int Rotation(int arr[],int no)
{
    int i,min,count ;
   
    min=arr[0] ;
    count=0 ;
    for(i=0;i<no;i++)
    {
        if(min>=arr[i])
        {
            if(arr[i]!=arr[i-1])
                count=i ;
            min=arr[i] ;
        }
    }
    return count ;
}  

Output:-



Geeksforgeeks Solution For " Rotation "

No comments:
Write comments

Recommended Posts × +