h3. "%{color:orange}Programare dinamica%":cauta-probleme?tag_id%5B%5D=58
* "Dinamica pe stari exponentiale":cauta-probleme?tag_id%5B%5D=59

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

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

* "Parcurgere in Latime **BFS**":cauta-probleme?tag_id%5B%5D=47
* "Parcurgere in Adancime **DFS**":cauta-probleme?tag_id%5B%5D=69

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

h3. "%{color:blue}Structuri de date%":cauta-probleme?tag_id%5B%5D=38
 
* "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

* "Sortare":cauta-probleme?tag_id%5B%5D=64

h3. "%{color:purple}Siruri de Caractere%":cauta-probleme?tag_id%5B%5D=55

h3. "%{color:purple}Siruri de caractere%":cauta-probleme?tag_id%5B%5D=55

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

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

* "Combinatorica":cauta-probleme?tag_id%5B%5D=281
 
 
 
 
h3. "%{color:black}Geometrie%":cauta-probleme?tag_id%5B%5D=41
* "No fit polygon":cauta-probleme?tag_id%5B%5D=259

h3. "%{color:red}Teoria jocurilor%":cauta-probleme?tag_id%5B%5D=60