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 | 2687 |
|
| MAJ | Majority Element | 2061 |
|
| MER | Merge Two Sorted Arrays | 2167 |
|
| 2SUM | 2SUM | 1411 |
|
| HEA | Building a Heap | 886 |
|
| MS | Merge Sort | 1449 |
|
| PAR | 2-Way Partition | 1095 |
|
| 3SUM | 3SUM | 835 |
|
| HS | Heap Sort | 715 |
|
| INV | Counting Inversions | 795 |
|
| PAR3 | 3-Way Partition | 890 |
|
| MED | Median | 747 |
|
| PS | Partial Sort | 608 |
|
| QS | Quick Sort | 634 |
|
