Probleme
Ușor · Math · Number theory
Mediu · Trees · Depth-first Search
Ușor · Graphs · Shortest paths
Mediu · Math · Number theory
Foarte dificil · Brute force
Dificil · Dynamic programming · Probabilities
Foarte dificil · Geometry · Graph matchings · Constructive Algorithms
Ușor · Geometry
Foarte dificil · Geometry · Math
Mediu · Two pointers · Math · Sorting
Foarte ușor · Implementation
Foarte dificil · Dynamic programming · Dynamic Programming Optimization · Prefix Sums · Combinatorics
Dificil · Number theory · Combinatorics · Bitmasks · Prime factorization
Ușor · Binary Search · Segment Tree
Foarte ușor · Math
Mediu · Dynamic programming
Foarte dificil · Graphs · Greedy algorithms · Constructive Algorithms
Foarte ușor · Graphs
Mediu · Dynamic programming · Prefix Function
Dificil · Geometry · Math
Foarte ușor · Greedy algorithms · Graphs
Ușor · String suffix structures · Brute force
Foarte ușor · Brute force · Math
Ușor · Math · Combinatorics
Dificil · Meet-in-the-middle · Binary Search · Greedy algorithms