1. Beginning
- A. a + b
- B. a + b^2
- C. Turtle
- D. Simple sort
- E. Meeting the people of Sortland
- A. Binary search
- B. Garland
- C. Is it a heap?
- D. Heap sort
- E. Radix sort
- A. Stack
- B. Queue
- C. Balanced brackets
- D. Postfix
- E. Priority queue
5. Hash tables
- A. Set
- B. Map
- C. Linked map
- D. Multi map
7. AVL tree
- A. Balance check
- B. Left rotation
- C. Addition into AVL tree
- D. Deletion from AVL tree
- E. Ordered elements in AVL tree
- A. From list of edges to adjacency matrix, directed graph
- B. Undirected graph check
- C. Multi-edges, undirected graph
- D. Connectivity components
- E. Shortest path in unweighted graph
- F. Labyrinth
9. DFS
- A. Topological sorting
- B. Cycles
- C. Bipartite graph
- D. Condensation of the graph
- E. Hamiltonian path
- F. Game
10. MST
- A. Shortest path (1)
- B. All-pairs shortest path
- C. Shortest path (2)
- D. Shortest paths and some stuff
- E. Negative cycle
12. Flows on graphs
- A. Max flow
- B. Matching
- C. Flow decomposition
- D. Circulation