Dynamic Programming, Facebook Coding Interview, Google Coding Interview, Coding Interviews, Java.
j sum(i, j) + min(dp[i][k-1], dp[k+1][j]) Minimum Coin change Input array coins[] where coins[i] is denomination and total for which we need to find minimum coin change. Dp state dp[i][j] represents minimum coin change required to create value j using coins from 0 to i i = 0 to coins.length j = 0