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 | 2786 |
|
| MAJ | Majority Element | 2145 |
|
| MER | Merge Two Sorted Arrays | 2246 |
|
| 2SUM | 2SUM | 1464 |
|
| HEA | Building a Heap | 924 |
|
| MS | Merge Sort | 1500 |
|
| PAR | 2-Way Partition | 1138 |
|
| 3SUM | 3SUM | 868 |
|
| HS | Heap Sort | 739 |
|
| INV | Counting Inversions | 825 |
|
| PAR3 | 3-Way Partition | 920 |
|
| MED | Median | 772 |
|
| PS | Partial Sort | 627 |
|
| QS | Quick Sort | 655 |
|
