# Dynamic programming collection

G&G search result

http://www.geeksforgeeks.org/dynamic-programming-set-9-binomial-coefficient/

Dynamic Programming | Set 6 (Min Cost Path)

http://www.geeksforgeeks.org/dynamic-programming-set-6-min-cost-path/

Dynamic Programming | Set 7 (Coin Change)

http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/

Dynamic Programming | Set 8 (Matrix Chain Multiplication)

http://www.geeksforgeeks.org/dynamic-programming-set-8-matrix-chain-multiplication/

Dynamic Programming | Set 9 (Binomial Coefficient)

http://www.geeksforgeeks.org/dynamic-programming-set-9-binomial-coefficient/

Dynamic Programming | Set 13 (Cutting a Rod)

http://www.geeksforgeeks.org/dynamic-programming-set-13-cutting-a-rod/

Two versions of state functions:

I:

cutRod(n) = max(price[i] + cutRod(n-i-1)) for all i in {0, 1 .. n-1}

II:

d[i][j] = max(d[i-1][j], d[i-1][j-i-1] + V[i])

reduced to 1D:

d[i] = max(d[i], d[i-j-i]+V[j])

note: i should increase from 1 to n

Dynamic Programming | Set 11 (Egg Dropping Puzzle)

http://www.geeksforgeeks.org/dynamic-programming-set-11-egg-dropping-puzzle/

Dynamic Programming | Set 19 (Word Wrap Problem)

http://www.geeksforgeeks.org/dynamic-programming-set-18-word-wrap/

Dynamic Programming | Set 31 (Optimal Strategy for a Game)

http://www.geeksforgeeks.org/dynamic-programming-set-31-optimal-strategy-for-a-game/