[algogeeks] Largest contigious subarray with average greather than k

[Koup]

Consider an array of N integers. Find the longest contiguous subarray 
so that the average of its elements is greater than a given number k 

I know the general brute force solution in O(N^2). Is there any 
efficient solution using extra space?

--