Probleme

Ușor · Hashing

Dificil · Brute force

Ușor · Greedy algorithms · Sorting

Ușor · Dynamic programming

Dificil · Dynamic programming · Combinatorics

Foarte dificil · Graphs

Foarte ușor · Binary Search

Foarte ușor · Prefix Sums · String suffix structures

Foarte dificil · Binary Search · Greedy algorithms · Disjoint set union · Graphs · Sorting

Foarte dificil · Probabilities

Foarte ușor · Graphs

Foarte ușor · Implementation

Mediu

Dificil · Bitmasks · Dynamic programming · Greedy algorithms

Ușor · Implementation

Foarte ușor · Brute force · Strings

Dificil · Graphs · Depth-first Search · Constructive Algorithms · Strings

Dificil · Shortest paths · Breadth-first Search · Graphs · Dynamic programming

Dificil · Dynamic programming · Sorting · Strings · Combinatorics

Foarte dificil · Greedy algorithms · Binary Search · Geometry · Math · Optimization

Foarte dificil · Graph network flows · Expression parsing

Foarte dificil · Graphs

Ușor · Math

Mediu · Math

Foarte ușor · Binary Search