Given infinite coins of values 1, x, and y, find the minimum number of coins required to make a target sum S using dynamic programming or a breadth-first search approach.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.