* "Parcurgere in latime **BFS**":cauta-probleme?tag_id%5B%5D=47 "^[problema clasica]^":problema/bfs
* "Parcurgere in adancime **DFS**":cauta-probleme?tag_id%5B%5D=69 "^[problema clasica]^":problema/dfs
* "Algoritmul lui Dijkstra":cauta-probleme?tag_id%5B%5D=72 "^[problema clasica]^":problema/dijkstra

* "Algoritmul Bellman-Ford":cauta-probleme?tag_id%5B%5D=92
* "Flux maxim":cauta-probleme?tag_id%5B%5D=268
* "Flux maxim de cost minim":cauta-probleme?tag_id%5B%5D=93
* "Lowest Common Ancestor":cauta-probleme?tag_id%5B%5D=82

* "Algoritmul Bellman-Ford":cauta-probleme?tag_id%5B%5D=92 "^[problema clasica]^":problema/bellmanford
* "Flux maxim":cauta-probleme?tag_id%5B%5D=268 "^[problema clasica]^":problema/maxflow
* "Flux maxim de cost minim":cauta-probleme?tag_id%5B%5D=93 "^[problema clasica]^":problema/fmcm
* "Lowest Common Ancestor":cauta-probleme?tag_id%5B%5D=82 "^[problema clasica]^":problema/lca

* "Lant hamiltonian":cauta-probleme?tag_id%5B%5D=57
* "Lant eulerian":cauta-probleme?tag_id%5B%5D=112

* "2-SAT":cauta-probleme?tag_id%5B%5D=87
* "Componente tare conexe":cauta-probleme?tag_id%5B%5D=88

* "2-SAT":cauta-probleme?tag_id%5B%5D=87 "^[problema clasica]^":problema/2sat
* "Componente tare conexe":cauta-probleme?tag_id%5B%5D=88 "^[problema clasica]^":problema/ctc

h3. "%{color:blue}Structuri de date%":cauta-probleme?tag_id%5B%5D=38
* "Arbori de intervale":cauta-probleme?tag_id%5B%5D=84 "^[problema clasica]^":problema/arbint
* "Arbori indexati binar":cauta-probleme?tag_id%5B%5D=106 "^[problema clasica]^":problema/aib

* "Range Minimum Query":cauta-probleme?tag_id%5B%5D=83

* "Range Minimum Query":cauta-probleme?tag_id%5B%5D=83 "^[problema clasica]^":problema/rmq

* "Ortogonal Range Search":cauta-probleme?tag_id%5B%5D=297

h3. "%{color:red}Backtracking%":cauta-probleme?tag_id%5B%5D=96

* "Submultimi":cauta-probleme?tag_id%5B%5D=98

* "Submultimi":cauta-probleme?tag_id%5B%5D=98 "^[problema clasica]^":problema/submultimi

h3. "%{color:black}Divide et Impera%":cauta-probleme?tag_id%5B%5D=89

* "Algoritmul lui Euclid":cauta-probleme?tag_id%5B%5D=43 "^[problema clasica]^":problema/euclid2
* "Exponentiere rapida":cauta-probleme?tag_id%5B%5D=262 "^[problema clasica]^":problema/lgput
* "Formula":cauta-probleme?tag_id%5B%5D=105

* "Combinatorica":cauta-probleme?tag_id%5B%5D=281 "^[problema clasica]^":problema/combinari

* "Combinatorica":cauta-probleme?tag_id%5B%5D=281

* "Aria unui poligon":cauta-probleme?tag_id%5B%5D=110
* "Intersectie de poligoane":cauta-probleme?tag_id%5B%5D=295
* "Teorema lui Pick":cauta-probleme?tag_id%5B%5D=111

* "Infasuratoare convexa":cauta-probleme?tag_id%5B%5D=265

* "Infasuratoare convexa":cauta-probleme?tag_id%5B%5D=265 "^[problema clasica]^":problema/infasuratoare

* "Rotating calipers":cauta-probleme?tag_id%5B%5D=266
* "No fit polygon":cauta-probleme?tag_id%5B%5D=259