Dynamic Programming

» SPOJ 346. Bytelandian Gold Coins (COINS)
» SPOJ 6219. Edit Distance (EDIST)



Subset Sum/0-1 Knapsack Problem

» uVA 10664. Luggage
» SPOJ 8545. Subset Sum (MAIN72)
» SPOJ 97. Party Schedule (PARTY)

For more problems that can be solved using Dynamic Programming, please visit this URL.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: