table(example). |_. Denumire problema |_. Categorie|_. Responsabil |_. Stare|
|Cel mai lung subsir comun|Programare dinamica|== user(user="filipb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Cel mai lung subsir crescator|Programare dinamica|-|==Stars(rating="0" scale="1" type="small")==|

|Knapsack|Programare dinamica|== user(user="gabitzish" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Knapsack|Programare dinamica|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Cautare binara|?|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Euclid extins|Matematica|-|==Stars(rating="0" scale="1" type="small")==|
|Parcurgere BFS|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|

|Parcurgere DFS - componente conexe|Grafuri|== user(user="gabitzish" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Parcurgere DFS - componente conexe|Grafuri|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Componente biconexe|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Componente tare-conexe|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Sortare topologica|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|

|Algoritmul lui Djikstra|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Floyd-Warshall|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Bellman-Ford|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|

|Algoritmul Roy-Floyd|Grafuri|== user(user="gabitzish" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Algoritmul Roy-Floyd|Grafuri|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

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