Day 32 of LeetCode
Documenting LeetCode solving.
Q93
322. Coin Change
Medium. 1D DP.
class Solution {
public int coinChange(int[] coins, int amount) {
int[] dp = new int[amount + 1];
Arrays.fill(dp, amount + 1);
dp[0] = 0;
for (int...
evelynsjourney.hashnode.dev3 min read