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 | 2769 |
|
| MAJ | Majority Element | 2130 |
|
| MER | Merge Two Sorted Arrays | 2234 |
|
| 2SUM | 2SUM | 1453 |
|
| HEA | Building a Heap | 916 |
|
| MS | Merge Sort | 1488 |
|
| PAR | 2-Way Partition | 1129 |
|
| 3SUM | 3SUM | 862 |
|
| HS | Heap Sort | 733 |
|
| INV | Counting Inversions | 815 |
|
| PAR3 | 3-Way Partition | 912 |
|
| MED | Median | 766 |
|
| PS | Partial Sort | 621 |
|
| QS | Quick Sort | 650 |
|
