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 | 2761 |
|
| MAJ | Majority Element | 2123 |
|
| MER | Merge Two Sorted Arrays | 2226 |
|
| 2SUM | 2SUM | 1451 |
|
| HEA | Building a Heap | 915 |
|
| MS | Merge Sort | 1485 |
|
| PAR | 2-Way Partition | 1126 |
|
| 3SUM | 3SUM | 861 |
|
| HS | Heap Sort | 732 |
|
| INV | Counting Inversions | 813 |
|
| PAR3 | 3-Way Partition | 910 |
|
| MED | Median | 764 |
|
| PS | Partial Sort | 620 |
|
| QS | Quick Sort | 649 |
|
