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 | 2797 |
|
| MAJ | Majority Element | 2155 |
|
| MER | Merge Two Sorted Arrays | 2255 |
|
| 2SUM | 2SUM | 1469 |
|
| HEA | Building a Heap | 926 |
|
| MS | Merge Sort | 1503 |
|
| PAR | 2-Way Partition | 1140 |
|
| 3SUM | 3SUM | 871 |
|
| HS | Heap Sort | 742 |
|
| INV | Counting Inversions | 827 |
|
| PAR3 | 3-Way Partition | 922 |
|
| MED | Median | 776 |
|
| PS | Partial Sort | 631 |
|
| QS | Quick Sort | 658 |
|
