_Algoritmi pe grafuri:_

table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Parcurgere BFS|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|'Parcurgere DFS - componente conexe':problema/dfs|== user(user="gabitzish1" 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") ==|==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") ==|==Stars(rating="1" scale="1" type="small")==|
|'Algoritmul Floyd-Warshall/Roy-Floyd':problema/royfloyd|== user(user="gabitzish1" type="tiny")==|==Stars(rating="1" scale="1" type="small")==|
|Algoritmul Bellman-Ford|== user(user="Dastas" type="tiny") ==|==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")==|
|Lowest Common Ancestor| == user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|2SAT|-|==Stars(rating="0" scale="1" type="small")==|

table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Parcurgere BFS|'Florian':utilizator/Florian|-|==Stars(rating="0" scale="1" type="small")==|
|'Parcurgere DFS - componente conexe':problema/dfs|'gabitzish1':utilizator/gabitzish1|'DitzoneC':utilizator/DitzoneC|==Stars(rating="1" scale="1" type="small")==|
|Componente biconexe|-|-|==Stars(rating="0" scale="1" type="small")==|
|Componente tare-conexe|'Tabara':utilizator/Tabara|-|==Stars(rating="0" scale="1" type="small")==|
|'Sortare topologica':problema/sortaret|'Tabara':utilizator/Tabara|'DitzoneC':utilizator/ditzonec|==Stars(rating="1" scale="1" type="small")==|
|Lant hamiltonian|-|-|==Stars(rating="0" scale="1" type="small")==|
|Ciclu eulerian|'pepelea_flaviu':utilizator/pepelea_flaviu|-|==Stars(rating="0" scale="1" type="small")==|
|Arbore partial de cost minim|'Tabara':utilizator/Tabara|-|==Stars(rating="0" scale="1" type="small")==|
|'Algoritmul lui Djikstra':problema/dijkstra|'Dastas':utilizator/Dastas|'filipb':utilizator/filipb|==Stars(rating="1" scale="1" type="small")==|
|'Algoritmul Floyd-Warshall/Roy-Floyd':problema/royfloyd|'gabitzish1':utilizator/gabitzish1|'filipb':utilizator/filipb|==Stars(rating="1" scale="1" type="small")==|
|Algoritmul Bellman-Ford|'Dastas':utilizator/Dastas|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim|'fireatmyself':utilizator/fireatmyself|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim de cost minim|'fireatmyself':utilizator/fireatmyself|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|'fireatmyself':utilizator/fireatmyself|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim de cost minim|'fireatmyself':utilizator/fireatmyself|-|==Stars(rating="0" scale="1" type="small")==|
|Lowest Common Ancestor|'devilkind':utilizator/devilkind|-|==Stars(rating="0" scale="1" type="small")==|
|2SAT|-|-|==Stars(rating="0" scale="1" type="small")==|

_Siruri de caractere:_

table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|'Potrivirea sirurilor':problema/strmatch|== user(user="Bogdan2412" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Arbori de sufixe|-|==Stars(rating="0" scale="1" type="small")==|
|Trie|-|==Stars(rating="0" scale="1" type="small")==|

table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Potrivirea sirurilor':problema/strmatch|'Bogdan2412':utilizator/Bogdan2412|'filipb':utilizator/filipb|==Stars(rating="1" scale="1" type="small")==|
|Arbori de sufixe|-|-|==Stars(rating="0" scale="1" type="small")==|
|Trie|-|-|==Stars(rating="0" scale="1" type="small")==|

_Structuri de date:_

table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Heapuri|== user(user="floringh06" 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") ==|==Stars(rating="1" scale="1" type="small")==|
|Arbori de intervale aplicatie 1|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 2|-|==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")==|
|Double ended queue (deque)|-|==Stars(rating="0" scale="1" type="small")==|
|Structuri de multimi disjuncte|-|==Stars(rating="0" scale="1" type="small")==|
|Treapuri|== user(user="Bogdan2412" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Heapuri|'floringh06':utilizator/floringh06|-|==Stars(rating="0" scale="1" type="small")==|
|Hashuri|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Arbori de intervale':problema/arbint|'cos_min':utilizator/cos_min|'DitzoneC':utilizator/ditzonec|==Stars(rating="1" scale="1" type="small")==|
|Arbori de intervale aplicatie 1|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 2|-|-|==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|'cos_min':utilizator/cos_min|-|==Stars(rating="0" scale="1" type="small")==|
|Range Minimum Query|'devilkind':utilizator/devilkind|-|==Stars(rating="0" 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|'Bogdan2412':utilizator/Bogdan2412|'filipb':utilizator/filipb|==Stars(rating="1" scale="1" type="small")==|

_Geometrie:_

table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Intersectia a doua drepte|== user(user="nash" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Aria unui poligon|-|==Stars(rating="0" scale="1" type="small")==|
|Punct in poligon|-|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|== user(user="nash" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Diagrame Voronoi|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta minima intre doua puncte in plan|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta maxima intre doua puncte in plan|-|==Stars(rating="0" scale="1" type="small")==|

table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Intersectia a doua drepte|'nash':utilizator/nash|-|==Stars(rating="0" scale="1" type="small")==|
|Aria unui poligon|-|-|==Stars(rating="0" scale="1" type="small")==|
|Punct in poligon|-|-|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|'nash':utilizator/nash|-|==Stars(rating="0" scale="1" type="small")==|
|Diagrame Voronoi|-|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta minima intre doua puncte in plan|-|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta maxima intre doua puncte in plan|-|-|==Stars(rating="0" scale="1" type="small")==|

_Diverse:_

table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Cautare binara|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|'Ridicare la putere in timp logaritmic':problema/lgput|== user(user="tudalex" type="tiny") ==
|==Stars(rating="1" scale="1" type="small")==|
|'Evaluare de expresii':problema/evaluare|== user(user="sima_cotizo" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Sprague-Grundy(Teoria jocurilor)|-|==Stars(rating="0" scale="1" type="small")==|
|Statistici de ordine|-|==Stars(rating="0" scale="1" type="small")==|
|Operatii pe numere mari|== user(user="savim" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Cautare binara|'Florian':utilizator/Florian|-|==Stars(rating="0" scale="1" type="small")==|
|'Ridicare la putere in timp logaritmic':problema/lgput|'tudalex':utilizator/tudalex|'filipb':utilizator/filipb|==Stars(rating="1" scale="1" type="small")==|
|'Evaluare de expresii':problema/evaluare|'sima_cotizo':utilizator/sima_cotizo|'DitzoneC':utilizator/DitzoneC|==Stars(rating="1" scale="1" type="small")==|
|Sprague-Grundy(Teoria jocurilor)|-|-|==Stars(rating="0" scale="1" type="small")==|
|Statistici de ordine|-|-|==Stars(rating="0" scale="1" type="small")==|
|Operatii pe numere mari|'savim':utilizator/savim|-|==Stars(rating="0" scale="1" type="small")==|