Probleme
Foarte ușor · Graphs · Implementation
Foarte dificil · Brute force · String suffix structures
Foarte dificil · Geometry
Foarte ușor · Math
Foarte dificil · Graphs · Dynamic programming
Foarte ușor · Implementation
Ușor · Prime factorization · Binary Search
Mediu · Dynamic programming
Foarte dificil · Geometry
Ușor · Graphs · Shortest paths
Mediu · Greedy algorithms · Sorting · Disjoint set union · Graphs
Dificil · Breadth-first Search · Shortest paths · Graphs
Ușor · Implementation
Foarte dificil · Geometry
Foarte dificil · Math · Number theory · Combinatorics · Matrix · Constructive Algorithms
Dificil · Breadth-first Search · Bitmasks · Graphs
Mediu · Geometry
Foarte dificil · Dynamic programming · Bitmasks
Foarte dificil · Trees · Data Structures · Range queries · Dynamic programming
Foarte ușor · Graphs · Dynamic programming
Ușor · Dynamic programming · Combinatorics
Mediu · Dynamic programming · Binary Search
Ușor · Graphs · Geometry
Mediu · Math · Dynamic programming
Dificil · Greedy algorithms · Trees · Sorting · Breadth-first Search