Задачи
Тешко · Geometry · Convex Hull · Strings · Number theory · Sorting
Средно · Dynamic programming · Strings · Greedy algorithms
Многу тешко · Dynamic programming · Matrix · Dynamic Programming Optimization
Средно · Number theory · Prime factorization
Средно · Math · Number theory · Hashing · Probabilities
Многу тешко · Data Structures · Trees
Тешко · Constructive Algorithms
Многу тешко · Math · Number theory
Средно · Strings
Многу тешко · Combinatorics · Convex Hull · Geometry · Dynamic programming
Средно · Dynamic programming · Knapsack · Combinatorics
Средно · Prefix Sums · Bitwise Operations · Brute force
Многу тешко · Dynamic programming · Dynamic Programming Optimization · Sorting · Greedy algorithms
Многу тешко · Trees · Binary Search · Prefix Sums · SQRT Decomposition · Data Structures · Depth-first Search
Многу тешко · Suffix Array · Sparse Table · Data Structures · Binary Search · Strings
Многу тешко · Trees · Data Structures · Bitwise Operations · Divide and Conquer · Range queries · Prefix Sums
Тешко · Geometry · Scanline / Sweep Line · Greedy algorithms
Многу тешко · Matrix · Dynamic programming · Number theory · Bitmasks
Лесно · Two pointers · Greedy algorithms
Лесно · Combinatorics · Math
Средно · Combinatorics · Dynamic programming
Средно · Combinatorics · Number theory · Prefix Sums
Лесно · Two pointers · Prefix Sums
Многу тешко · Dynamic programming · Graphs · Sorting · Shortest paths · Probabilities
Тешко · Graphs · Breadth-first Search · Strings