Задачи
Многу тешко · Dynamic programming · Geometry · Combinatorics
Многу тешко · Segment Tree · Data Structures · Scanline / Sweep Line · Greedy algorithms
Многу тешко · Dynamic programming · Combinatorics · Graphs · Number theory
Многу тешко · Dynamic programming · Prefix Sums · Combinatorics
Многу лесно · Depth-first Search · Graphs
Лесно · Two pointers
Средно · Dynamic programming · Strings
Средно · Two pointers
Многу лесно · Binary Search
Лесно · Implementation · Number theory
Лесно · Implementation
Многу лесно · Dynamic programming
Лесно · Implementation · Dynamic programming
Лесно · Implementation
Многу лесно · Greedy algorithms · Priority Queue · Sorting
Лесно · Combinatorics
Средно · Greedy algorithms · Combinatorics · Math
Лесно · Number theory · Sorting
Средно · Dynamic programming
Многу лесно · Combinatorics · Probabilities
Многу лесно · Trees · Depth-first Search
Тешко · Greedy algorithms · Sorting · Stacks
Средно · Breadth-first Search · Shortest paths · Dynamic programming
Многу тешко · Segment Tree · Bitwise Operations · Data Structures · Prefix Sums
Многу лесно · Geometry · Sorting · Hashing · Binary Search · Data Structures