python (65.2k questions)

javascript (44.3k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (13k questions)

Questions - bottom-up

How can I add limited coins to the coin change problem? (Bottom-up - Dynamic programming)

I am new to dynamic programming (and C++ but I have more experience, some things are still unknown to me). How can I add LIMITED COINS to the coin change problem (see my code below - is a bit messy bu...
test-img

Alin M.

c++

dynamic-programming

coin-change

bottom-up

Votes: 0

Answers: 2

Latest Answer

I'm working under the assumption that you need to generate change for a positive integer value, amount using your nbr table where nbr[n] is the number of coins available of value n. I'm also working ...
test-img

selbie

Count the sum of subsets of size k when the sum is (Greater than or equal to R) or (Lesser than or equal to L)

def knapSack(A,L,R,K,N,Sum): if(K==0): if((L>=Sum)or(R<=Sum)): return 1 else: return 0 if((N==0)and(K!=0)): return 0 else: ret...
test-img

Arun kumar

count

dynamic-programming

subset-sum

bottom-up

Votes: 0

Answers: 1

Latest Answer

Here is a dynamic programming algorithm you can use. The algorithm will be used to generate all subsets of size K. This algorithm uses one element of A one after another to build subsets. STEPS Initi...
test-img

Wilson

Posts

Questions

Blogs

Jobs