@atul: question is to find the largest continuous sub array .. not just continuous sub array ..
we can do this with same logic as mentioned in the above link.. we have to traverse whole array.. even if we get the solution .. whenever we get the solution,update the "largest_subarray_start_index" and "largest_subarray_end_index" based on previous length of the solution sub array . On Mon, Sep 3, 2012 at 9:26 AM, atul anand <atul.87fri...@gmail.com> wrote: > http://www.geeksforgeeks.org/archives/19267 > > > On Mon, Sep 3, 2012 at 7:41 AM, Amitesh Singh <singh.amit...@gmail.com>wrote: > >> Given a array, find the largest contiguous sub-array having its sum equal >> to N. >> >> -- >> 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. > -- 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.
