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 | 2575 |
|
| MAJ | Majority Element | 1996 |
|
| MER | Merge Two Sorted Arrays | 2076 |
|
| 2SUM | 2SUM | 1366 |
|
| HEA | Building a Heap | 838 |
|
| MS | Merge Sort | 1396 |
|
| PAR | 2-Way Partition | 1037 |
|
| 3SUM | 3SUM | 810 |
|
| HS | Heap Sort | 674 |
|
| INV | Counting Inversions | 774 |
|
| PAR3 | 3-Way Partition | 845 |
|
| MED | Median | 707 |
|
| PS | Partial Sort | 573 |
|
| QS | Quick Sort | 595 |
|
