table(example). |_. Denumire problema|_. Voluntar|_. Finalizat|
| Cuplaj maxim de cost minim | == user(user="savim" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |

| Principiul includerii si excluderii | == user(user="savim" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |

| Huffman | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |
| 2SAT | == user(user="cezarmocan" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| Lowest Common Ancestor | == user(user="mishu91" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |

|NIM|Teoria jocurilor|
|Sprague-Grundy|Teoria jocurilor|
|Algoritmul lui Gauss|Matematica|

|Principiul includerii si excluderii|Matematica|

|Problema de acoperire|Programare dinamica + Backtracking|
|Algoritmul Bellman-Ford|Algoritmi pe grafuri|
|Algoritmul Stoer-Wagner|Algoritmi pe grafuri|