* == user(user="Florian" type="tiny") ==
* == user(user="Tabara" type="tiny") ==
* == user(user="cos_min" type="tiny") ==

* == user(user="Bogdan2412" type="tiny") ==

h2(#documentatie). Documentatie

table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Algoritmul lui Euclid|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

|Algoritmul lui Euclid extins|-|==Stars(rating="0" scale="1" type="small")==|

|Algoritmul lui Euclid extins|== user(user="Bogdan2412" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Algoritmul lui Gauss|-|==Stars(rating="0" scale="1" type="small")==|
_Backtracking:_

|Cel mai lung subsir comun|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Cel mai lung subsir crescator|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Knapsack|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Distanta Levenshtein|-|==Stars(rating="0" scale="1" type="small")==|

_Algoritmi pe grafuri:_

|Flux maxim de cost minim|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim de cost minim|-|==Stars(rating="0" scale="1" type="small")==|

|Lowest Common Ancestor|-|==Stars(rating="0" scale="1" type="small")==|

|Lowest Common Ancestor|== user(user="Bogdan2412" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

_Siruri de caractere:_
table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|

|Potrivirea sirurilor|-|==Stars(rating="0" scale="1" type="small")==|

|Potrivirea sirurilor|== user(user="Bogdan2412" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Arbori de sufixe|-|==Stars(rating="0" scale="1" type="small")==|
|Trie|-|==Stars(rating="0" scale="1" type="small")==|