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.

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.

Permalink: http://problemotd.com/problem/balanced-partition/

Content curated by @MaxBurstein

## Comments: