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 | 1562 |
|
| MAJ | Majority Element | 1207 |
|
| MER | Merge Two Sorted Arrays | 1267 |
|
| 2SUM | 2SUM | 836 |
|
| HEA | Building a Heap | 551 |
|
| MS | Merge Sort | 854 |
|
| PAR | 2-Way Partition | 650 |
|
| 3SUM | 3SUM | 492 |
|
| HS | Heap Sort | 444 |
|
| INV | Counting Inversions | 479 |
|
| PAR3 | 3-Way Partition | 521 |
|
| MED | Median | 430 |
|
| PS | Partial Sort | 372 |
|
| QS | Quick Sort | 382 |
|
