Dynamic Programming

# Coin Problem

From the Competitive Programmer’s Handbook.
What is the smallest number of coins required to form a sum $x$?

Recursive Solution

My recent submission on LeetCode where I return `-1`

when no solution exists.

Iterative solution + storing solution