# 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:-

Previous Post
Next Post

#### post written by: Ghanendra Yadav

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me