# Tag Archives: dp-coin-change

Given an integer V and an array arr[] consisting of N integers, the task is to find the maximum number of array elements that canâ€¦ Read More
Given an array arr[] of size N representing the available denominations and an integer X. The task is to find any combination of the minimumâ€¦ Read More
The Coin Change Problem is considered by many to be essential to understanding the paradigm of programming known as Dynamic Programming. The two often areâ€¦ Read More
Given a number k, find the required minimum number of Fibonacci terms whose sum equal to k. We can choose a Fibonacci number multiple times.â€¦ Read More
Given a value of V Rs and an infinite supply of each of the denominations {1, 2, 5, 10, 20, 50, 100, 500, 1000} valuedâ€¦ Read More
Given a value V, if we want to make a change for V cents, and we have an infinite supply of each of Câ€¦ Read More
Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1,â€¦ Read More
Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1,â€¦ Read More
Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1,â€¦ Read More