The problem of finding a smallest collection of operations that changes a structure into a nicely ordered one.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| INS | Insertion Sort | 2711 |
|
| MAJ | Majority Element | 2080 |
|
| MER | Merge Two Sorted Arrays | 2186 |
|
| 2SUM | 2SUM | 1422 |
|
| HEA | Building a Heap | 895 |
|
| MS | Merge Sort | 1459 |
|
| PAR | 2-Way Partition | 1102 |
|
| 3SUM | 3SUM | 842 |
|
| HS | Heap Sort | 718 |
|
| INV | Counting Inversions | 800 |
|
| PAR3 | 3-Way Partition | 894 |
|
| MED | Median | 750 |
|
| PS | Partial Sort | 610 |
|
| QS | Quick Sort | 637 |
|
