Given an array with + and - numbers, including zero, Write an algorithm to
find all the possible sub arrays which sum up to zero.

For example, if given array is

20 , -9 , 3 , 1, 5 , 0, -6 , 9

Then possible sub arrays are:
-9, 3, 1, 5
0
1, 5, 0, -6

-- 
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.

Reply via email to