Probleme
Mediu · Brute force · Bitmasks
Dificil · Combinatorics · Dynamic programming · Number theory
Foarte dificil · Hashing · Binary Search · Sorting · Number theory
Ușor · Graphs · Trees
Foarte dificil · Geometry
Foarte dificil · Breadth-first Search · Hashing · Bitmasks
Ușor · String suffix structures · Implementation
Ușor · Sorting · Greedy algorithms
Ușor · Priority Queue
Dificil · Graphs · Shortest paths
Foarte ușor · Geometry
Ușor · Graphs
Mediu · Dynamic programming
Foarte dificil · Graphs · Greedy algorithms · Depth-first Search · Prefix Sums
Foarte dificil · Dynamic programming
Foarte ușor · Dynamic programming
Mediu · Implementation · Dynamic programming
Foarte ușor · Implementation
Foarte ușor · Graphs · Brute force
Dificil · Geometry
Foarte ușor · Geometry
Dificil · Geometry · Disjoint set union · Graphs
Foarte ușor · Implementation
Mediu · Depth-first Search
Foarte ușor · Implementation