Задачи

Лесно · Hashing

Тешко · Brute force

Лесно · Greedy algorithms · Sorting

Лесно · Dynamic programming

Тешко · Dynamic programming · Combinatorics

Многу тешко · Graphs

Многу лесно · Binary Search

Многу лесно · Prefix Sums · String suffix structures

Многу тешко · Binary Search · Greedy algorithms · Disjoint set union · Graphs · Sorting

Многу тешко · Probabilities

Многу лесно · Graphs

Многу лесно · Implementation

Средно

Тешко · Bitmasks · Dynamic programming · Greedy algorithms

Лесно · Implementation

Многу лесно · Brute force · Strings

Тешко · Graphs · Depth-first Search · Constructive Algorithms · Strings

Тешко · Shortest paths · Breadth-first Search · Graphs · Dynamic programming

Тешко · Dynamic programming · Sorting · Strings · Combinatorics

Многу тешко · Greedy algorithms · Binary Search · Geometry · Math · Optimization

Многу тешко · Graph network flows · Expression parsing

Многу тешко · Graphs

Лесно · Math

Средно · Math

Многу лесно · Binary Search