Balanced partition of an array using Dynamic programming http://codepad.org/2vK13zWb <http://codepad.org/2vK13zWb>PS: always add zero to the beginning of the series to get the proper result.
On Tue, Aug 31, 2010 at 6:49 PM, Jinsong Huang <[email protected]>wrote: > This is "Balanced Partition" problem which can be solved by using > Dynamic Programming, see #7 on this page, > > http://people.csail.mit.edu/bdean/6.046/dp/ > > On Aug 31, 3:12 pm, Raj Jagvanshi <[email protected]> wrote: > > There is an array of some no only 0-9. You have to divide it into two > > array such that sum of elements in each array is same. > > Eg input {1,2,3,4} output {1,4}{2,3} > > -- > 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]<algogeeks%[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.
