make a sum array..such that..sum[i]=sum of number from 0 to i-1....make a node which has 2 data..sum[i] and ith index itself..sort this node array according to sum[i]...now check for consecutive value which have same value...corresponding index i,j to that sum nodes will be start and end of subarray...look for all such subarray..its an O(nlgn)..solution...:) hope it works..!!
-- 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.
