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 | 2724 |
|
| MAJ | Majority Element | 2094 |
|
| MER | Merge Two Sorted Arrays | 2199 |
|
| 2SUM | 2SUM | 1432 |
|
| HEA | Building a Heap | 902 |
|
| MS | Merge Sort | 1468 |
|
| PAR | 2-Way Partition | 1110 |
|
| 3SUM | 3SUM | 847 |
|
| HS | Heap Sort | 725 |
|
| INV | Counting Inversions | 807 |
|
| PAR3 | 3-Way Partition | 901 |
|
| MED | Median | 756 |
|
| PS | Partial Sort | 616 |
|
| QS | Quick Sort | 642 |
|
