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 | 2820 |
|
| MAJ | Majority Element | 2167 |
|
| MER | Merge Two Sorted Arrays | 2270 |
|
| 2SUM | 2SUM | 1480 |
|
| HEA | Building a Heap | 933 |
|
| MS | Merge Sort | 1512 |
|
| PAR | 2-Way Partition | 1146 |
|
| 3SUM | 3SUM | 877 |
|
| HS | Heap Sort | 747 |
|
| INV | Counting Inversions | 834 |
|
| PAR3 | 3-Way Partition | 929 |
|
| MED | Median | 783 |
|
| PS | Partial Sort | 636 |
|
| QS | Quick Sort | 667 |
|
