title: Finding the minimum set of coins that make a given value
body: <p>I've been trying to figure out if there would be a way to get the optimal minimum set of coins that would be used to make the change.</p>
  <p>The greedy algorithm approach for this has an issue such as if we have the set of coins {1, 5, 6, 9} and we wanted to get the value 11. The greedy algorithm would give us {9,1,1} however the most optimal solution would be {5, 6}</p>
  <p>From reading through this <a href="https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/" rel="nofollow noreferrer">site</a> I've found that this method can give us the total minimum number of coins needed. Would there be a way to get the set of coins from that as well?</p>