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 | 2677 |
|
| MAJ | Majority Element | 2053 |
|
| MER | Merge Two Sorted Arrays | 2161 |
|
| 2SUM | 2SUM | 1407 |
|
| HEA | Building a Heap | 885 |
|
| MS | Merge Sort | 1445 |
|
| PAR | 2-Way Partition | 1093 |
|
| 3SUM | 3SUM | 834 |
|
| HS | Heap Sort | 714 |
|
| INV | Counting Inversions | 794 |
|
| PAR3 | 3-Way Partition | 889 |
|
| MED | Median | 746 |
|
| PS | Partial Sort | 607 |
|
| QS | Quick Sort | 633 |
|
