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 | 2788 |
|
| MAJ | Majority Element | 2147 |
|
| MER | Merge Two Sorted Arrays | 2247 |
|
| 2SUM | 2SUM | 1465 |
|
| HEA | Building a Heap | 925 |
|
| MS | Merge Sort | 1501 |
|
| PAR | 2-Way Partition | 1139 |
|
| 3SUM | 3SUM | 869 |
|
| HS | Heap Sort | 740 |
|
| INV | Counting Inversions | 826 |
|
| PAR3 | 3-Way Partition | 921 |
|
| MED | Median | 774 |
|
| PS | Partial Sort | 629 |
|
| QS | Quick Sort | 656 |
|
