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 | 2706 |
|
| MAJ | Majority Element | 2077 |
|
| MER | Merge Two Sorted Arrays | 2182 |
|
| 2SUM | 2SUM | 1419 |
|
| HEA | Building a Heap | 894 |
|
| MS | Merge Sort | 1456 |
|
| PAR | 2-Way Partition | 1100 |
|
| 3SUM | 3SUM | 840 |
|
| HS | Heap Sort | 718 |
|
| INV | Counting Inversions | 799 |
|
| PAR3 | 3-Way Partition | 893 |
|
| MED | Median | 749 |
|
| PS | Partial Sort | 610 |
|
| QS | Quick Sort | 636 |
|
