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 | 2826 |
|
| MAJ | Majority Element | 2171 |
|
| MER | Merge Two Sorted Arrays | 2275 |
|
| 2SUM | 2SUM | 1483 |
|
| HEA | Building a Heap | 936 |
|
| MS | Merge Sort | 1516 |
|
| PAR | 2-Way Partition | 1149 |
|
| 3SUM | 3SUM | 880 |
|
| HS | Heap Sort | 750 |
|
| INV | Counting Inversions | 837 |
|
| PAR3 | 3-Way Partition | 932 |
|
| MED | Median | 786 |
|
| PS | Partial Sort | 639 |
|
| QS | Quick Sort | 670 |
|
