| # | title | topic | type | difficulty |
|---|---|---|---|---|
| 1 | Quicksort from scratch | Sorting Algorithms | Coding | Hard |
| 2 | Merge sort — prove it's stable | Sorting Algorithms | Coding | Hard |
| 3 | Insertion sort, in place | Sorting Algorithms | Coding | Medium |
| 4 | Multi-key sort with a composed comparator | Sorting Algorithms | Coding | Hard |
| 5 |
| Sort numbers correctly |
| Sorting Algorithms |
| Coding |
| Easy |
| 6 | The pointer that walks the wrong way | Sorting Algorithms | gap | Medium |
| 7 | The smallest one, from where? | Sorting Algorithms | gap | Medium |
| 8 | Ten came before two | Sorting Algorithms | Multiple choice | Medium |
| 9 | The same sort, without writing a sort | Sorting Algorithms | Coding | Medium |
| 10 | Look at the best capture first | Sorting Algorithms | gap | Medium |
| 11 | The move with no score went last, and the comparator never saw it | Sorting Algorithms | Multiple choice | Hard |
| 12 | Rank first, then file, and the falsy trap between them | Sorting Algorithms | gap | Medium |
| 13 | Bishop and knight are both worth three | Sorting Algorithms | Multiple choice | Medium |