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 | 2373 |
|
| MAJ | Majority Element | 1854 |
|
| MER | Merge Two Sorted Arrays | 1931 |
|
| 2SUM | 2SUM | 1264 |
|
| HEA | Building a Heap | 763 |
|
| MS | Merge Sort | 1302 |
|
| PAR | 2-Way Partition | 963 |
|
| 3SUM | 3SUM | 749 |
|
| HS | Heap Sort | 617 |
|
| INV | Counting Inversions | 717 |
|
| PAR3 | 3-Way Partition | 785 |
|
| MED | Median | 658 |
|
| PS | Partial Sort | 525 |
|
| QS | Quick Sort | 552 |
|
