- MÖVZU 31 (Dynamic Programming - 2D & 3D)—
- MÖVZU 32 (Bitmask DP)—
- MÖVZU 33 (Tree algorithms - root, parent, ancestor, subtree, diameter)—
- MÖVZU 34 (Weighted graphs - Dijkstra, Bellman-Ford, Floyd-Warshall)—
- MÖVZU 35 (Minimum Spanning Trees - Disjoint Set Union)—
- MÖVZU 36 (Segment Tree - single update queries)—
- MÖVZU 37 (Segment Tree - range update queries)—
- MÖVZU 38 (Divide & Conquer, DP optimization)—
- MÖVZU 39 (String search algorithms)—
- MÖVZU 40 (Geometry)—