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 | 1492 |
|
| MAJ | Majority Element | 1153 |
|
| MER | Merge Two Sorted Arrays | 1208 |
|
| 2SUM | 2SUM | 803 |
|
| HEA | Building a Heap | 528 |
|
| MS | Merge Sort | 821 |
|
| PAR | 2-Way Partition | 626 |
|
| 3SUM | 3SUM | 469 |
|
| HS | Heap Sort | 427 |
|
| INV | Counting Inversions | 462 |
|
| PAR3 | 3-Way Partition | 502 |
|
| MED | Median | 415 |
|
| PS | Partial Sort | 356 |
|
| QS | Quick Sort | 372 |
|
