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 | 2776 |
|
| MAJ | Majority Element | 2135 |
|
| MER | Merge Two Sorted Arrays | 2239 |
|
| 2SUM | 2SUM | 1459 |
|
| HEA | Building a Heap | 920 |
|
| MS | Merge Sort | 1495 |
|
| PAR | 2-Way Partition | 1133 |
|
| 3SUM | 3SUM | 866 |
|
| HS | Heap Sort | 734 |
|
| INV | Counting Inversions | 818 |
|
| PAR3 | 3-Way Partition | 915 |
|
| MED | Median | 767 |
|
| PS | Partial Sort | 622 |
|
| QS | Quick Sort | 651 |
|
