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 | 2858 |
|
| MAJ | Majority Element | 2190 |
|
| MER | Merge Two Sorted Arrays | 2298 |
|
| 2SUM | 2SUM | 1495 |
|
| HEA | Building a Heap | 945 |
|
| MS | Merge Sort | 1525 |
|
| PAR | 2-Way Partition | 1159 |
|
| 3SUM | 3SUM | 889 |
|
| HS | Heap Sort | 758 |
|
| INV | Counting Inversions | 844 |
|
| PAR3 | 3-Way Partition | 941 |
|
| MED | Median | 793 |
|
| PS | Partial Sort | 647 |
|
| QS | Quick Sort | 678 |
|
