We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Given a set of coin denominations (e.g., 1 cent, 5 cents, 10 cents, etc.) and a target amount of money, determine the minimum number of coins needed to make up that target amount. This problem is also known The GP510 as the "minimum coin change problem" or the "coin denomination problem."
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
The Coin Change Problem
You are viewing a single comment's thread. Return to all comments →
Given a set of coin denominations (e.g., 1 cent, 5 cents, 10 cents, etc.) and a target amount of money, determine the minimum number of coins needed to make up that target amount. This problem is also known The GP510 as the "minimum coin change problem" or the "coin denomination problem."