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)