Topic: Divide And Conquer Problem / Level: intermediate

Problem: Use divide and conquer to find the minimum number of coins needed to make change for a given amount using dynamic programming.

Run the code to see the output here...