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 | 2743 |
|
| MAJ | Majority Element | 2110 |
|
| MER | Merge Two Sorted Arrays | 2214 |
|
| 2SUM | 2SUM | 1445 |
|
| HEA | Building a Heap | 912 |
|
| MS | Merge Sort | 1478 |
|
| PAR | 2-Way Partition | 1121 |
|
| 3SUM | 3SUM | 855 |
|
| HS | Heap Sort | 730 |
|
| INV | Counting Inversions | 810 |
|
| PAR3 | 3-Way Partition | 906 |
|
| MED | Median | 760 |
|
| PS | Partial Sort | 618 |
|
| QS | Quick Sort | 645 |
|
