The problems presented here are mostly taken from the algorithms course BE5B33ALG,
see https://cw.fel.cvut.cz/b211/courses/be5b33alg for more details on the course.
Asymptotic complexity ( = basic programmer reasoning )
Recursion/backtrack
Tree traversals
Queue, BFS
DFS
Search trees
Dynamic programming
Inactive problem, serves just as an exam example etc.: https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=pary