Azerbaijan Computing OlympiadMÖVZU 31 (2DP & 3DP and Bitmask DP) MÖVZU 32 (Segment Tree - Single Update Queries) 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 (String hashing, Rabin-Karp, KMP) MÖVZU 37 (Segment Tree - Advanced versions, lazy propagation) MÖVZU 38 (Binary Jumping - Lowest Common Ancestor) MÖVZU 39 (Divide & Conquer, Square Root Decomposition)
