Problemi
Difficile · Greedy algorithms · Disjoint set union · Sorting · Graphs
Molto difficile · Binary Search · Fenwick Tree · Sorting
Molto difficile · Greedy algorithms · Sorting · Combinatorics
Molto difficile · Dynamic programming · Dynamic Programming Optimization · Prefix Sums · Greedy algorithms
Molto facile · Math
Media · Implementation · Sorting · Greedy algorithms
Facile · Hashing
Media · Binary Search · Greedy algorithms · Sorting
Molto facile · Prefix Sums · String suffix structures
Difficile · Graphs · Depth-first Search · Constructive Algorithms
Molto difficile · Binary Search · Dynamic programming · Greedy algorithms · Sorting
Media · Dynamic programming
Difficile · Geometry · Strings · Hashing · Greedy algorithms
Facile · Prefix Sums
Molto difficile · Segment Tree · Fenwick Tree · Data Structures · Sorting · Scanline / Sweep Line · Range queries
Difficile · Dynamic programming · Geometry · Graphs
Molto facile · Implementation
Molto difficile · Binary Search · Trees · Depth-first Search · Greedy algorithms
Difficile · Brute force · Implementation
Molto difficile · Segment Tree · Dynamic programming · Combinatorics · Sorting
Molto facile · Stacks
Facile · Hashing · Sorting
Media · Prefix Sums · Binary Search
Facile · Math · Binary Search
Molto facile · Stacks