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 | 2005 |
|
| MAJ | Majority Element | 1564 |
|
| MER | Merge Two Sorted Arrays | 1638 |
|
| 2SUM | 2SUM | 1073 |
|
| HEA | Building a Heap | 662 |
|
| MS | Merge Sort | 1106 |
|
| PAR | 2-Way Partition | 823 |
|
| 3SUM | 3SUM | 639 |
|
| HS | Heap Sort | 536 |
|
| INV | Counting Inversions | 618 |
|
| PAR3 | 3-Way Partition | 674 |
|
| MED | Median | 560 |
|
| PS | Partial Sort | 457 |
|
| QS | Quick Sort | 468 |
|
