Category: Dynamic Programming
Difficulty: intermediate
Description: Minimum coins for target amount
Time Complexity: O(nW)
Space Complexity: O(W)