Tag Archives: subset sum

Equal partitioning with minimum difference in sum

Posted on by

Given an array consisting of N Numbers.
Divide it into two Equal partitions (in size both contains N/2 elements) such that difference between sum of both partitions is minimum. If number of elements are odd difference in partition size can be at most 1.

This is a preview of Equal partitioning with minimum difference in sum. Read the full post (1158 words, estimated 4:38 mins reading time)

Subset sum problem – Dynamic Programming

Posted on by

Given a set (or multiset) of integers, is there a non-empty subset whose sum is zero?

For example, given the set {−7, −3, −2, 5, 8}, the answer is yes because the subset {−3, −2, 5} sums to zero. The problem is NP-complete. A variant of this problem could be formulated as –

This is a preview of Subset sum problem – Dynamic Programming. Read the full post (594 words, estimated 2:23 mins reading time)