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 | 2748 |
|
| MAJ | Majority Element | 2111 |
|
| MER | Merge Two Sorted Arrays | 2216 |
|
| 2SUM | 2SUM | 1448 |
|
| HEA | Building a Heap | 913 |
|
| MS | Merge Sort | 1480 |
|
| PAR | 2-Way Partition | 1124 |
|
| 3SUM | 3SUM | 859 |
|
| HS | Heap Sort | 730 |
|
| INV | Counting Inversions | 811 |
|
| PAR3 | 3-Way Partition | 908 |
|
| MED | Median | 761 |
|
| PS | Partial Sort | 618 |
|
| QS | Quick Sort | 646 |
|
