mediumBlind 75
Coin Change
Given an array of coin denominations and a target amount Return the minimum number of coins needed to make up the amount Return -1 if it's not possible to make the amount You have infinite coins of each denomination Example: coins = [1,2,5], amount = 11 => 3 (5+5+1)
I build up from amount zero, not down from the target. Each amount asks which single coin gets it there cheapest.
Arrays & HashingDynamic ProgrammingBFS / DFS
Meet Coco
Coco is an AI study partner, not a person. She listens while you explain your code, asks what a line does and never hands you the fix. Typing with Coco is free when you sign in, up to a daily limit. Talking with her out loud comes with the $79 pack. Anyone can open the editor and run their code.
1Minimum Coins to Make Amountmedium
2Part 2
3Part 3
Each locked part opens in the editor once the part before it passes.
Based onLeetCode