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 | 2653 |
|
| MAJ | Majority Element | 2038 |
|
| MER | Merge Two Sorted Arrays | 2143 |
|
| 2SUM | 2SUM | 1396 |
|
| HEA | Building a Heap | 876 |
|
| MS | Merge Sort | 1434 |
|
| PAR | 2-Way Partition | 1080 |
|
| 3SUM | 3SUM | 826 |
|
| HS | Heap Sort | 706 |
|
| INV | Counting Inversions | 788 |
|
| PAR3 | 3-Way Partition | 880 |
|
| MED | Median | 738 |
|
| PS | Partial Sort | 602 |
|
| QS | Quick Sort | 626 |
|
