In tabelul de mai jos se afla probleme la care se lucreaza in momentul de fata. Finalizarea lor reprezinta unul dintre $OKR$-urile din trimestrul IV, 2009. Pentru a va familiariza si cu restul obiectivelor din acest trimestru, cititi 'aici':okr.

table(example). |_. Denumire problema|_. Voluntar|_. Finalizat|
| 'Cuplaj maxim de cost minim':problema/cmcm | == user(user="savim" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |
| 'Principiul includerii si excluderii':problema/pinex | == user(user="savim" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| 'Huffman':problema/huffman | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |
| Algoritmul Bellman-Ford | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| '2SAT':problema/2sat | == user(user="cezarmocan" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| 'Al K-lea termen Fibonacci - Matrici':problema/kfib | == user(user="cezarmocan" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| 'Lowest Common Ancestor':problema/lca | == user(user="mishu91" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |
| 'Statistici de ordine':problema/sdo | == user(user="mishu91" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |
| 'Parantezare optima de matrici':problema/podm | == user(user="marius" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== |
| 'Treapuri':problema/treapuri | == user(user="marius" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| Ciclu hamiltonian | == user(user="pauldb" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| 'Submulţimi':problema/submultimi | ==user(user="GheorgheMihai" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
 

table(example). |_. Denumire problema|_. Voluntar|_. Finalizat|_. Review |
| 'Cuplaj maxim de cost minim':problema/cmcm | == user(user="savim" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| 'Principiul includerii si excluderii':problema/pinex | == user(user="savim" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Huffman':problema/huffman | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| Algoritmul Bellman-Ford | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| '2SAT':problema/2sat | == user(user="cezarmocan" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Al K-lea termen Fibonacci - Matrici':problema/kfib | == user(user="cezarmocan" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Lowest Common Ancestor':problema/lca | == user(user="mishu91" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| 'Statistici de ordine':problema/sdo | == user(user="mishu91" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| 'Parantezare optima de matrici':problema/podm | == user(user="marius" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| 'Treapuri':problema/treapuri | == user(user="marius" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| Ciclu hamiltonian | == user(user="pauldb" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Submulţimi':problema/submultimi | ==user(user="GheorgheMihai" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Distanţa minimă între două puncte în plan':problema/cmap | ==user(user="GheorgheMihai" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Distanţa maximă între două puncte în plan':problema/cmdp | ==user(user="GheorgheMihai" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== | ==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.

|Punct in poligon|Geometrie|
|Punct in poligon convex|Geometrie|
|Diagrame Voronoi|Geometrie|

|Distanta minima intre doua puncte in plan|Geometrie|
|Distanta maxima intre doua puncte in plan|Geometrie|

|Minimum enclosing circle|Geometrie|
|Sortare prin numarare|Diverse|
|RadixSort|Diverse|