Problemi

Molto difficile · Dynamic programming · Geometry · Combinatorics

Molto difficile · Segment Tree · Data Structures · Scanline / Sweep Line · Greedy algorithms

Molto difficile · Dynamic programming · Combinatorics · Graphs · Number theory

Molto difficile · Dynamic programming · Prefix Sums · Combinatorics

Molto facile · Depth-first Search · Graphs

Facile · Two pointers

Media · Dynamic programming · Strings

Media · Two pointers

Molto facile · Binary Search

Facile · Implementation · Number theory

Facile · Implementation

Molto facile · Dynamic programming

Facile · Implementation · Dynamic programming

Facile · Implementation

Molto facile · Greedy algorithms · Priority Queue · Sorting

Facile · Combinatorics

Media · Greedy algorithms · Combinatorics · Math

Facile · Number theory · Sorting

Media · Dynamic programming

Molto facile · Combinatorics · Probabilities

Molto facile · Trees · Depth-first Search

Difficile · Greedy algorithms · Sorting · Stacks

Media · Breadth-first Search · Shortest paths · Dynamic programming

Molto difficile · Segment Tree · Bitwise Operations · Data Structures · Prefix Sums

Molto facile · Geometry · Sorting · Hashing · Binary Search · Data Structures