http://groups.google.com/group/algogeeks/browse_thread/thread/ed7295fbe2009b2/54665b73e297d752?hl=en&q=Sub-array+problem&lnk=ol&;
hope this link would help to find solution for the given problem. On Sat, Dec 24, 2011 at 9:41 PM, top coder <topcode...@gmail.com> wrote: > 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? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
