I need a help with this dynamic programming problem please. It is from the entrance exam practice problem set:
Given an integer sequence x_1 ... x_n is there a nonempty sub sequences which sums to zero? Describe - no code necessary - a dynamic programming solution based on the predicate: "A nonempty sub sequence of x_1 ... x_n has sum s" I think that solution should be built on the recursive backtracking function that selects a min from these subsequences choices, but I think I am missing lots of details here. Any assistance is appreciated. Thank you in advance. -- 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.
