Rajiv, What about the numbers greater than "k" distance(BTW, i wrote L, not k), you have to have atleast k and not necessarily k.
[EMAIL PROTECTED] wrote: > Just store the cummulative sums in one pass, > second pass, keep two pointers at a distance > k away, pass through the array once more and > note the maximum! > bigOh(n)! Pls let me know if you can do better.. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
