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 | 1747 |
|
| MAJ | Majority Element | 1350 |
|
| MER | Merge Two Sorted Arrays | 1416 |
|
| 2SUM | 2SUM | 922 |
|
| HEA | Building a Heap | 594 |
|
| MS | Merge Sort | 955 |
|
| PAR | 2-Way Partition | 701 |
|
| 3SUM | 3SUM | 540 |
|
| HS | Heap Sort | 486 |
|
| INV | Counting Inversions | 521 |
|
| PAR3 | 3-Way Partition | 566 |
|
| MED | Median | 469 |
|
| PS | Partial Sort | 410 |
|
| QS | Quick Sort | 422 |
|
