DP: Coin Change, is a HackerRank problem from Techniques / Concepts subdomain. In this post we will see how we can solve this challenge in Java

Problem Description

Given a number of dollars and an array of denominations of coins, determine how many ways you can make change. For example, making change for dollars from coin denominations , there are ways to make change:

1 1 1 1 1 1 1 1 1 1 1 1 1 5 5 1 1 1 1 1 1 1 5 1 1 1 1 1 1 1 1 1 1 2 2 5 5 1 1 1 1 1 1 ....

You can find the full details of the problem DP: Coin Change at HackerRank

Solution: Please check the DPCoinChange.java snippet for the solution.

Solution originally posted at: Github by @Java-aid