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 | 2814 |
|
| MAJ | Majority Element | 2164 |
|
| MER | Merge Two Sorted Arrays | 2265 |
|
| 2SUM | 2SUM | 1476 |
|
| HEA | Building a Heap | 930 |
|
| MS | Merge Sort | 1509 |
|
| PAR | 2-Way Partition | 1144 |
|
| 3SUM | 3SUM | 875 |
|
| HS | Heap Sort | 745 |
|
| INV | Counting Inversions | 831 |
|
| PAR3 | 3-Way Partition | 926 |
|
| MED | Median | 780 |
|
| PS | Partial Sort | 634 |
|
| QS | Quick Sort | 664 |
|
