This is an old revision of the document!
[1] Informații generale 1: https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/
[2] Informații generale 2: https://www.codechef.com/wiki/tutorial-dynamic-programming
[3] Problema treptelor: http://www.geeksforgeeks.org/count-ways-reach-nth-stair/
[4] Șiruri binare fără elemente consecutive de 1: http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/
[5] Rest în monede: http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/
[6] Cel mai lung subșir crescător: http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/
[7] Variațiune a celui mai lung subșir crescător: http://www.geeksforgeeks.org/dynamic-programming-set-14-maximum-sum-increasing-subsequence/
[8] Cel mai lung subșir comun: http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/
[9] Distanța de editare: http://www.geeksforgeeks.org/dynamic-programming-set-5-edit-distance/