Hi all, How can we find the the maximum sum of atleast L consecutive integers given a sequence of N integers.
The brute force approach of forming all possible length sequences at every index and finding their sum gives an O(N^2) solution which is not desirable. Can somebody tell me a better approach for this ? --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
