agree with hemank ! 2011/9/2 hemank lamba <[email protected]>
> Are you sure it is not continuous subsets. Because otherwise i guess it is > a NP problem. > > > On Fri, Sep 2, 2011 at 7:58 AM, manish kapur > <[email protected]>wrote: > >> given an unsorted array of +ve and -ve elements.find a subarray with sum= >> k in O(n). >> you can use some 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
