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 | 2825 |
|
| MAJ | Majority Element | 2170 |
|
| MER | Merge Two Sorted Arrays | 2274 |
|
| 2SUM | 2SUM | 1483 |
|
| HEA | Building a Heap | 935 |
|
| MS | Merge Sort | 1514 |
|
| PAR | 2-Way Partition | 1148 |
|
| 3SUM | 3SUM | 880 |
|
| HS | Heap Sort | 749 |
|
| INV | Counting Inversions | 835 |
|
| PAR3 | 3-Way Partition | 930 |
|
| MED | Median | 784 |
|
| PS | Partial Sort | 638 |
|
| QS | Quick Sort | 669 |
|
