Probleme

Foarte dificil · Binary Search · Dynamic programming · Trees

Mediu · Constructive Algorithms · Greedy algorithms

Foarte ușor · Matrix · Segment Tree

Foarte ușor · Dynamic programming · Hashing

Foarte ușor · Dynamic programming

Foarte ușor · Number theory · Prime factorization

Mediu · Geometry

Foarte dificil · Binary Search · Graph network flows · Greedy algorithms

Foarte ușor · Greedy algorithms

Ușor · Number theory · Math

Dificil · Breadth-first Search · Graphs

Ușor · Divide and Conquer

Foarte dificil · String suffix structures · Suffix Array · Strings

Dificil · Graphs · Geometry · Depth-first Search · Constructive Algorithms · Sorting

Foarte dificil · Number theory

Foarte dificil · Dynamic programming · Combinatorics

Foarte dificil · Dynamic programming

Mediu · Combinatorics · Constructive Algorithms · Graphs

Foarte dificil · Graphs · Dynamic programming

Dificil · Geometry

Dificil · Dynamic programming · Sorting

Mediu · Bitwise Operations · Strings

Mediu · Geometry · Math

Foarte dificil · Math

Foarte ușor · Implementation