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 | 2780 |
|
| MAJ | Majority Element | 2140 |
|
| MER | Merge Two Sorted Arrays | 2241 |
|
| 2SUM | 2SUM | 1461 |
|
| HEA | Building a Heap | 923 |
|
| MS | Merge Sort | 1498 |
|
| PAR | 2-Way Partition | 1135 |
|
| 3SUM | 3SUM | 867 |
|
| HS | Heap Sort | 738 |
|
| INV | Counting Inversions | 822 |
|
| PAR3 | 3-Way Partition | 918 |
|
| MED | Median | 769 |
|
| PS | Partial Sort | 624 |
|
| QS | Quick Sort | 652 |
|
