- MÖVZU 21 (Constructive & Simulation algorithms)—
- MÖVZU 22 (Recursion & Memoization & Tabulation)—
- MÖVZU 23 (Dynamic Programming - 1D)—
- MÖVZU 24 (Dynamic Programming - 2D, Interval DP, Knapsack problem)—
- MÖVZU 27 (Graph Theory - Introduction)—
- MÖVZU 28 (DFS - Depth First Search)—
- MÖVZU 29 (Topological Sort, Strongly-Connected Components)—
- MÖVZU 30 (BFS - Breadth First Search)—