Problem of the Day
A new programming or logic puzzle every Mon-Fri

Given a set of N integers, partition them in to two buckets such that |N1 - N2| is as small as possible where N1 and N2 are the sums of the partitions.

Comments:

• There are currently no comments. You can be first!