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 | 1671 |
|
| MAJ | Majority Element | 1288 |
|
| MER | Merge Two Sorted Arrays | 1352 |
|
| 2SUM | 2SUM | 889 |
|
| HEA | Building a Heap | 574 |
|
| MS | Merge Sort | 912 |
|
| PAR | 2-Way Partition | 681 |
|
| 3SUM | 3SUM | 519 |
|
| HS | Heap Sort | 467 |
|
| INV | Counting Inversions | 504 |
|
| PAR3 | 3-Way Partition | 548 |
|
| MED | Median | 452 |
|
| PS | Partial Sort | 393 |
|
| QS | Quick Sort | 405 |
|
