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 | 2851 |
|
| MAJ | Majority Element | 2187 |
|
| MER | Merge Two Sorted Arrays | 2292 |
|
| 2SUM | 2SUM | 1492 |
|
| HEA | Building a Heap | 942 |
|
| MS | Merge Sort | 1523 |
|
| PAR | 2-Way Partition | 1156 |
|
| 3SUM | 3SUM | 887 |
|
| HS | Heap Sort | 756 |
|
| INV | Counting Inversions | 843 |
|
| PAR3 | 3-Way Partition | 939 |
|
| MED | Median | 792 |
|
| PS | Partial Sort | 645 |
|
| QS | Quick Sort | 677 |
|
