Differences
This shows you the differences between two versions of the page.
|
pa:materiale_test_practic:articole [2016/04/01 01:32] cosmin.dragomir [Programare dinamică] |
pa:materiale_test_practic:articole [2016/04/02 12:38] (current) cosmin.dragomir [Programare dinamică] |
||
|---|---|---|---|
| Line 11: | Line 11: | ||
| ===== Greedy ===== | ===== Greedy ===== | ||
| - [[https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/|Informații generale]] | - [[https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/|Informații generale]] | ||
| - | - [[http://www.infoarena.ro/metoda-greedy-si-problema-fractionara-a-rucsacului?revision=18|Problema Rucsacului - cazul continuu]] | + | - [[http://www.infoarena.ro/metoda-greedy-si-problema-fractionara-a-rucsacului?revision=18|Problema Rucsacului - varianta fracționară]] |
| - [[http://geeksquiz.com/greedy-algorithm-to-find-minimum-number-of-coins/|Număr minim de monede - valori multiplu]] | - [[http://geeksquiz.com/greedy-algorithm-to-find-minimum-number-of-coins/|Număr minim de monede - valori multiplu]] | ||
| - [[http://www.geeksforgeeks.org/job-sequencing-problem-set-1-greedy-algorithm/|Alegere task-uri]] | - [[http://www.geeksforgeeks.org/job-sequencing-problem-set-1-greedy-algorithm/|Alegere task-uri]] | ||
| Line 21: | Line 21: | ||
| - [[http://www.geeksforgeeks.org/count-ways-reach-nth-stair/|Problema treptelor]] | - [[http://www.geeksforgeeks.org/count-ways-reach-nth-stair/|Problema treptelor]] | ||
| - [[http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/|Șiruri binare fără elemente consecutive de 1]] | - [[http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/|Șiruri binare fără elemente consecutive de 1]] | ||
| - | - [[http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/|Număr posibilități de rest în monede]] | ||
| - | - [[http://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/|Număr minim de monede - varianta nesimplificată]] | ||
| - [[http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/|Cel mai lung subșir crescător]] | - [[http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/|Cel mai lung subșir crescător]] | ||
| - [[http://www.geeksforgeeks.org/dynamic-programming-set-14-maximum-sum-increasing-subsequence/|Variațiune a celui mai lung subșir crescător]] | - [[http://www.geeksforgeeks.org/dynamic-programming-set-14-maximum-sum-increasing-subsequence/|Variațiune a celui mai lung subșir crescător]] | ||
| + | - [[http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/|Număr posibilități de rest în monede]] | ||
| + | - [[http://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/|Număr minim de monede - varianta nesimplificată]] | ||
| - [[http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/|Cel mai lung subșir comun]] | - [[http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/|Cel mai lung subșir comun]] | ||
| - | - [[http://www.geeksforgeeks.org/dynamic-programming-set-5-edit-distance/|Distanța de editare]] | ||
| ===== Backtracking ===== | ===== Backtracking ===== | ||
