1

You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using

Correct Answer: dynamic programming

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.