Topic: Dynamic Programming Problem / Level: intermediate

Problem: Solve the "Tallest Billboard" problem where you partition an array into two subsets such that their sums are as equal as possible using dynamic programming.

Run the code to see the output here...