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 | 2779 |
|
| MAJ | Majority Element | 2138 |
|
| MER | Merge Two Sorted Arrays | 2240 |
|
| 2SUM | 2SUM | 1460 |
|
| HEA | Building a Heap | 922 |
|
| MS | Merge Sort | 1497 |
|
| PAR | 2-Way Partition | 1134 |
|
| 3SUM | 3SUM | 867 |
|
| HS | Heap Sort | 737 |
|
| INV | Counting Inversions | 821 |
|
| PAR3 | 3-Way Partition | 917 |
|
| MED | Median | 768 |
|
| PS | Partial Sort | 624 |
|
| QS | Quick Sort | 652 |
|
