# Geeksforgeeks Solution For " Subarray with least average "

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 :- Subarray with least average

Solution :-

#include <iostream>
using namespace std;
void find(int arr[],int n,int k)
{
int sum=0,i,sum1=0,start;
for(i=0;i<k-1;i++)
sum1=arr[i];
sum=sum1;
for(i=k;i<n;i++)
{
sum=sum+arr[i]-arr[i-k];
if(sum<sum1)
{
sum1=sum;
start=i-k+1;
}
}
cout<<start+1<<" "<<start+k;
}
int main() {
int t,n,k,arr[1000],i;
cin>>t;
while(t--)
{
cin>>n>>k;
for(i=0;i<n;i++)
cin>>arr[i];
find(arr,n,k);
cout<<"\n";
}
return 0;
}

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.