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 | 2666 |
|
| MAJ | Majority Element | 2046 |
|
| MER | Merge Two Sorted Arrays | 2153 |
|
| 2SUM | 2SUM | 1400 |
|
| HEA | Building a Heap | 879 |
|
| MS | Merge Sort | 1439 |
|
| PAR | 2-Way Partition | 1084 |
|
| 3SUM | 3SUM | 829 |
|
| HS | Heap Sort | 708 |
|
| INV | Counting Inversions | 789 |
|
| PAR3 | 3-Way Partition | 883 |
|
| MED | Median | 740 |
|
| PS | Partial Sort | 603 |
|
| QS | Quick Sort | 628 |
|
