table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Cel mai lung subsir comun':problema/cmlsc|== user(user="filipb" type="tiny") ==|== 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")==|

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

|Knapsack|== user(user="gabitzish1" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|Subsecventa de suma maxima|== user(user="GavrilaVlad" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
_Algoritmi pe grafuri:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|

|Parcurgere BFS|== user(user="Florian" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|

|Parcurgere BFS|-|-|==Stars(rating="0" scale="1" type="small")==|

|'Parcurgere DFS - componente conexe':problema/dfs|== user(user="gabitzish1" type="tiny") ==|== user(user="DitzoneC" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Componente biconexe|-|-|==Stars(rating="0" scale="1" type="small")==|
|Componente tare-conexe|== user(user="Tabara" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|'Sortare topologica':problema/sortaret|== user(user="Tabara" type="tiny") ==|== user(user="DitzoneC" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Lant hamiltonian|-|-|==Stars(rating="0" scale="1" type="small")==|

|Ciclu eulerian|== user(user="pepelea_flaviu" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|Arbore partial de cost minim|== user(user="Tabara" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|'Algoritmul lui Djikstra':problema/dijkstra|== user(user="Dastas" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

|Ciclu eulerian|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbore partial de cost minim|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Algoritmul lui Dijkstra':problema/dijkstra|== user(user="Dastas" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

|'Algoritmul Floyd-Warshall/Roy-Floyd':problema/royfloyd|== user(user="gabitzish1" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

|Algoritmul Bellman-Ford|== user(user="filipb" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|

|Algoritmul Bellman-Ford|-|-|==Stars(rating="0" scale="1" type="small")==|

|Flux maxim|== user(user="fireatmyself" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|

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

|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|== user(user="devilkind" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|2SAT|-|-|==Stars(rating="0" scale="1" type="small")==|

_Structuri de date:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|

|Heapuri|== user(user="floringh06" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|

|Heapuri|== user(user="floringh06" type="tiny") ==|== user(user="astronomy" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Hashuri|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Arbori de intervale':problema/arbint|== user(user="cos_min" type="tiny") ==|== user(user="Ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Arbori de intervale aplicatie 1|-|-|==Stars(rating="0" scale="1" type="small")==|

|Arbori de intervale aplicatie 3|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 4|-|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmi {$O(sqrtN)$}|-|-|==Stars(rating="0" scale="1" type="small")==|

|Arbori indexati binar|== user(user="cos_min" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|Range Minimum Query|== user(user="devilkind" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|

|'Arbori indexati binar':problema/aib|== user(user="cos_min" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Range Minimum Query':problema/rmq|== user(user="devilkind" type="tiny") ==|== user(user="ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

|Double ended queue (deque)|-|-|==Stars(rating="0" scale="1" type="small")==|
|Structuri de multimi disjuncte|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Treapuri':problema/treap|== user(user="Bogdan2412" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

_Diverse:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|

|Cautare binara|== user(user="Florian" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|

|Cautare binara|-|-|==Stars(rating="0" scale="1" type="small")==|

|'Ridicare la putere in timp logaritmic':problema/lgput|== user(user="tudalex" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Evaluare de expresii':problema/evaluare|== user(user="sima_cotizo" type="tiny") ==|== user(user="Ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Sprague-Grundy(Teoria jocurilor)|-|-|==Stars(rating="0" scale="1" type="small")==|