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 | 1785 |
|
| MAJ | Majority Element | 1380 |
|
| MER | Merge Two Sorted Arrays | 1451 |
|
| 2SUM | 2SUM | 945 |
|
| HEA | Building a Heap | 602 |
|
| MS | Merge Sort | 979 |
|
| PAR | 2-Way Partition | 720 |
|
| 3SUM | 3SUM | 557 |
|
| HS | Heap Sort | 491 |
|
| INV | Counting Inversions | 541 |
|
| PAR3 | 3-Way Partition | 584 |
|
| MED | Median | 485 |
|
| PS | Partial Sort | 413 |
|
| QS | Quick Sort | 424 |
|
