Probleme
Dificil · Graphs · Depth-first Search · Breadth-first Search
Foarte ușor · Implementation · Hashing
Foarte ușor · Dynamic programming
Mediu · Math
Ușor · Suffix Array · String suffix structures
Ușor · Sorting
Ușor · Geometry
Foarte dificil · Graphs · Dynamic programming
Foarte ușor · Implementation
Ușor · Graphs
Ușor · Number theory · Math
Foarte dificil · Graphs
Dificil · Dynamic programming · Bitmasks
Dificil · Dijkstra algorithm · Dynamic programming · Shortest paths
Foarte dificil · Scanline / Sweep Line · Segment Tree · Sorting
Mediu · Bitmasks · Dynamic programming · Sorting
Foarte dificil · Greedy algorithms
Dificil · Dynamic programming
Mediu · Geometry
Foarte ușor · Implementation
Foarte dificil · Brute force
Foarte ușor · Priority Queue · Greedy algorithms
Mediu · Strings · Greedy algorithms
Mediu · Implementation
Ușor · Dynamic programming