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 | 1320 |
|
| MAJ | Majority Element | 1024 |
|
| MER | Merge Two Sorted Arrays | 1070 |
|
| 2SUM | 2SUM | 717 |
|
| HEA | Building a Heap | 471 |
|
| MS | Merge Sort | 728 |
|
| PAR | 2-Way Partition | 547 |
|
| 3SUM | 3SUM | 415 |
|
| HS | Heap Sort | 382 |
|
| INV | Counting Inversions | 406 |
|
| PAR3 | 3-Way Partition | 440 |
|
| MED | Median | 369 |
|
| PS | Partial Sort | 315 |
|
| QS | Quick Sort | 330 |
|
