Problemi

Facile · Hashing

Difficile · Brute force

Facile · Greedy algorithms · Sorting

Facile · Dynamic programming

Difficile · Dynamic programming · Combinatorics

Molto difficile · Graphs

Molto facile · Binary Search

Molto facile · Prefix Sums · String suffix structures

Molto difficile · Binary Search · Greedy algorithms · Disjoint set union · Graphs · Sorting

Molto difficile · Probabilities

Molto facile · Graphs

Molto facile · Implementation

Media

Difficile · Bitmasks · Dynamic programming · Greedy algorithms

Facile · Implementation

Molto facile · Brute force · Strings

Difficile · Graphs · Depth-first Search · Constructive Algorithms · Strings

Difficile · Shortest paths · Breadth-first Search · Graphs · Dynamic programming

Difficile · Dynamic programming · Sorting · Strings · Combinatorics

Molto difficile · Greedy algorithms · Binary Search · Geometry · Math · Optimization

Molto difficile · Graph network flows · Expression parsing

Molto difficile · Graphs

Facile · Math

Media · Math

Molto facile · Binary Search