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 | 1701 |
|
| MAJ | Majority Element | 1310 |
|
| MER | Merge Two Sorted Arrays | 1377 |
|
| 2SUM | 2SUM | 900 |
|
| HEA | Building a Heap | 579 |
|
| MS | Merge Sort | 929 |
|
| PAR | 2-Way Partition | 687 |
|
| 3SUM | 3SUM | 526 |
|
| HS | Heap Sort | 472 |
|
| INV | Counting Inversions | 509 |
|
| PAR3 | 3-Way Partition | 553 |
|
| MED | Median | 456 |
|
| PS | Partial Sort | 397 |
|
| QS | Quick Sort | 409 |
|
