Coin change
Given coin denominations and a target amount, return the fewest coins that sum to the amount, or -1 if it cannot be made.
Implement
coin_change(coins: list[int], amount: int) → intExamples
in
[[1,2,5],11]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,2,5],11]3not run yetsample