h1. Portal infoarena
 
Aceasta este o lista cu diferite genuri de probleme de pe infoarena. Multe dintre probleme nu se rezolva folosind o singura tehinica de programare, acestea aparand listate la mai multe categorii.
 
 

h3. "%{color:orange}Programare dinamica%":cauta-probleme?tag_id%5B%5D=58

* "Probleme ad-hoc":cauta-probleme?tag_id%5B%5D=68
* "Problema rucsacului":cauta-probleme?tag_id%5B%5D=95

* "Dinamica pe stari exponentiale":cauta-probleme?tag_id%5B%5D=59

* "Dinamica pe arbore":cauta-probletag_id%5B%5D=71

* "Dinamica pe arbore":cauta-probleme?tag_id%5B%5D=71

* "Memoizare":cauta-probleme?tag_id%5B%5D=77

* "Exponentiere rapida de matrice":cauta-probleme?tag_id%5B%5D=283

h3. "%{color:orange}Grafuri%":cauta-probleme?tag_id%5B%5D=46

* "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 "^[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

* "Parcurgere in latime **BFS**":cauta-probleme?tag_id%5B%5D=47
* "Parcurgere in adancime **DFS**":cauta-probleme?tag_id%5B%5D=69
* "Algoritmul lui Dijkstra":cauta-probleme?tag_id%5B%5D=72
* "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

* "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 "^[problema clasica]^":problema/2sat
* "Componente tare conexe":cauta-probleme?tag_id%5B%5D=88 "^[problema clasica]^":problema/ctc
* "Componente biconexe":cauta-probleme?tag_id%5B%5D=433 "^[problema clasica]^":problema/biconex

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

h3. "%{color:blue}Structuri de date%":cauta-probleme?tag_id%5B%5D=38

* "Hash":cauta-probleme?tag_id%5B%5D=432
* "Heapuri":cauta-probleme?tag_id%5B%5D=285
* "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
* "Arbori indexati binar 2D":cauta-probleme?tag_id%5B%5D=85
* "Arbori echilibrati":cauta-probleme?tag_id%5B%5D=350
* "Trie":cauta-probleme?tag_id%5B%5D=76 "^[problema clasica]^":problema/trie
* "Deque":cauta-probleme?tag_id%5B%5D=94 "^[problema clasica]^":problema/deque
* "Multimi disjuncte/ disjoint datasets":cauta-probleme?tag_id%5B%5D=296
* "Range Minimum Query":cauta-probleme?tag_id%5B%5D=83 "^[problema clasica]^":problema/rmq
* "Ortogonal Range Search":cauta-probleme?tag_id%5B%5D=297

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

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

* "Cautare binara":cauta-probleme?tag_id%5B%5D=49 "^[problema clasica]^":problema/cautbin

* "Cautare binara":cauta-probleme?tag_id%5B%5D=49

h3. "%{color:green}Sortare%":cauta-probleme?tag_id%5B%5D=63

* "Parsare":cauta-probleme?tag_id%5B%5D=67
* "KMP":cauta-probleme?tag_id%5B%5D=56

* "Suffix array/ siruri de sufixe":cauta-probleme?tag_id%5B%5D=431

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

* "Submultimi":cauta-probleme?tag_id%5B%5D=98 "^[problema clasica]^":problema/submultimi
 
 
h3. "%{color:purple}Greedy%":cauta-probleme?tag_id%5B%5D=61
 
* "Ad-hoc":cauta-probleme?tag_id%5B%5D=70

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

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

h3. "%{color:black}Matematica%":cauta-probleme?tag_id%5B%5D=40

* "Ciurul lui Eratostene":cauta-probleme?tag_id%5B%5D=101 "^[problema clasica]^":problema/ciur
* "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

* "Ciurul lui Eratostene":cauta-probleme?tag_id%5B%5D=101

* "Formula":cauta-probleme?tag_id%5B%5D=105

* "Factorizare":cauta-probleme?tag_id%5B%5D=423

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

* "Coduri Gray":cauta-probleme?tag_id%5B%5D=443

h3. "%{color:black}Geometrie%":cauta-probleme?tag_id%5B%5D=41

* "Ad-hoc":cauta-probleme?tag_id%5B%5D=62
* "Baleiere":cauta-probleme?tag_id%5B%5D=80
* "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 "^[problema clasica]^":problema/infasuratoare
* "Rotating calipers":cauta-probleme?tag_id%5B%5D=266

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

h3. "%{color:green}Diverse%":cauta-probleme?tag_id%5B%5D=45
* "Operatii pe biti":cauta-probleme?tag_id%5B%5D=73

* "Operatii pe numere mari":cauta-probleme?tag_id%5B%5D=104
* "Evaluare de expresii":cauta-probleme?tag_id%5B%5D=91 "^[problema clasica]^":problema/evaluare
* "Normalizare":cauta-probleme?tag_id%5B%5D=298

* "Operatii pe numere mari":cauta-probleme?tag_id%5B%5D=104