Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    text
    copied!<p>See below</p> <ul> <li><a href="http://www.topcoder.com/tc?d1=tutorials&amp;d2=dynProg&amp;module=Static" rel="nofollow">http://www.topcoder.com/tc?d1=tutorials&amp;d2=dynProg&amp;module=Static</a></li> </ul> <p>and there are too many samples and articles reference at above article.</p> <p>After you learning dynamic programming you can improve your skill by solving <strong><a href="http://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;Itemid=8&amp;category=1" rel="nofollow">UVA</a></strong> problems, There are lists of some UVA dynamic programming problems in <strong><a href="http://online-judge.uva.es/board/viewtopic.php?t=4179" rel="nofollow">discussion board</a></strong> of UVA</p> <p>Also <strong><a href="http://en.wikipedia.org/wiki/Dynamic_programming#Egg_dropping_puzzle" rel="nofollow">Wiki</a></strong> has a good simple samples for it.</p> <p><strong>Edit:</strong> for book algorithm about it, you can use:</p> <ul> <li><a href="http://apress.com/book/view/1430232374" rel="nofollow">Python Algorithms: Mastering Basic Algorithms in the Python Language</a>: In this book you can see the practical working with DP.</li> <li><a href="http://mitpress.mit.edu/algorithms/" rel="nofollow">Introduction to Algorithms</a>: The simplest possible way of describing algorithms done in this book.</li> </ul> <p>Also you should take a look at <strong><a href="http://en.wikipedia.org/wiki/Memoization" rel="nofollow">Memoization</a></strong> in dynamic programming.</p>
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload