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 | 2812 |
|
| MAJ | Majority Element | 2162 |
|
| MER | Merge Two Sorted Arrays | 2263 |
|
| 2SUM | 2SUM | 1475 |
|
| HEA | Building a Heap | 929 |
|
| MS | Merge Sort | 1507 |
|
| PAR | 2-Way Partition | 1143 |
|
| 3SUM | 3SUM | 874 |
|
| HS | Heap Sort | 744 |
|
| INV | Counting Inversions | 829 |
|
| PAR3 | 3-Way Partition | 925 |
|
| MED | Median | 779 |
|
| PS | Partial Sort | 633 |
|
| QS | Quick Sort | 663 |
|
