Probleme

Foarte ușor · Greedy algorithms

Foarte dificil · Depth-first Search · Binary Search · Sorting

Mediu · Graph network flows · Breadth-first Search

Mediu · Brute force · Expression parsing

Mediu · Dynamic programming · Bitmasks · Bitwise Operations

Ușor · Dynamic programming

Mediu · Brute force · Binary Search

Dificil · Dynamic programming · Combinatorics · Probabilities

Foarte ușor · Math

Ușor · Math

Dificil · Implementation

Foarte ușor · Implementation · String suffix structures

Ușor · Dynamic programming · Sorting

Foarte dificil · Implementation

Foarte dificil · Graphs

Foarte dificil · Graphs · Dynamic programming

Foarte dificil · Implementation

Foarte dificil · Geometry · Combinatorics

Dificil · Implementation

Foarte dificil · Implementation · Brute force

Foarte dificil · Implementation · Math

Foarte dificil · Probabilities

Dificil · Two pointers · Sorting

Mediu · Geometry

Foarte dificil · Geometry