Problemi

Molto facile · Sorting · Greedy algorithms

Molto facile · Brute force · String suffix structures

Molto facile · Graphs

Facile · Implementation

Media · Greedy algorithms · Sorting · Geometry

Difficile · Dynamic programming · Combinatorics · Number theory

Facile · Graphs · Shortest paths

Molto facile · Dynamic programming · Prefix Sums

Difficile · Trees · Depth-first Search · Combinatorics · Prefix Sums · Binary Search

Molto difficile · Dynamic programming · Combinatorics · Greedy algorithms · Number theory · Stacks

Molto facile · Implementation

Molto facile · Implementation · Graphs

Media · Greedy algorithms · Prefix Sums

Media · Sorting · Greedy algorithms

Molto facile · Prefix Sums · Implementation

Facile · Graphs · Disjoint set union

Molto facile · Binary Search · Data Structures · Dynamic programming

Molto difficile · Binary Search · Data Structures · Greedy algorithms · Sorting

Molto difficile · Prefix Sums · Dynamic programming · Greedy algorithms · Scanline / Sweep Line

Facile · Prefix Sums · Dynamic programming

Molto difficile · Trees · Dynamic programming · Combinatorics · Depth-first Search · Number theory

Molto difficile · Dynamic programming · Dynamic Programming Optimization · Fenwick Tree · Segment Tree · Divide and Conquer

Molto facile · Geometry

Molto facile · Brute force

Molto facile · Sorting · Greedy algorithms