Skip to content

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 V, if we want to make a change for V Rs, and we have an infinite supply of each of the denominations… Read More
  Given a value V, if we want to make change for V cents, and we have 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