{"version":"1.0","type":"link","title":"Change-making problem - Newikis","description":"The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}