Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given an array of integers, partition the array into two subsets such that the sum difference between the two subsets is minimized.

Run the code to see the output here...