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 | 2756 |
|
| MAJ | Majority Element | 2121 |
|
| MER | Merge Two Sorted Arrays | 2223 |
|
| 2SUM | 2SUM | 1449 |
|
| HEA | Building a Heap | 914 |
|
| MS | Merge Sort | 1483 |
|
| PAR | 2-Way Partition | 1125 |
|
| 3SUM | 3SUM | 860 |
|
| HS | Heap Sort | 731 |
|
| INV | Counting Inversions | 812 |
|
| PAR3 | 3-Way Partition | 909 |
|
| MED | Median | 762 |
|
| PS | Partial Sort | 618 |
|
| QS | Quick Sort | 647 |
|
