table(example). |_. Denumire problema|_. Voluntar|_. Finalizat|
|Quicksort|== user(user="amadaeus" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Parcurgere BFS|== user(user="pauldb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

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

|Hashuri|== user(user="filipb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Ciclu eulerian|== user(user="amadaeus" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Trie|== user(user="amadaeus" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

|Trie|== user(user="amadaeus" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Double Ended Queue|== user(user="pauldb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Heapuri|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Cuplaj maxim in graf bipartit|== user(user="marius" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Flux|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim de cost minim|== user(user="pauldb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Invers modular|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Paduri de multimi disjuncte|== user(user="devilkind" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|

|Invers modular|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Paduri de multimi disjuncte|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

In tabelul de mai jos se afla sugestii privind algoritmii care trebuie sa se gaseasca sub forma de probleme in arhiva educationala. Puteti veni oricand cu propuneri si sugestii de probleme noi pe "forum":/forum/index.php?topic=3401.0.

|Lowest Common Ancestor|Algoritmi pe grafuri|
|2SAT|Algoritmi pe grafuri|
|Algoritmul Stoer-Wagner|Algoritmi pe grafuri|

|Coduri Huffman|Algoritmi pe grafuri|

|Siruri de sufixe|Siruri de caractere|
|Arbori de sufixe|Siruri de caractere|
|Arbori de intervale aplicatie 1|Structuri de date|