Problemi

Facile · Dynamic programming

Molto facile · Prefix Sums · Dynamic programming

Molto facile · Sorting

Molto facile · Binary Search

Media · Sorting · Geometry · Constructive Algorithms

Molto facile · Implementation

Difficile · Math

Molto facile · Sorting

Facile · Breadth-first Search · Shortest paths

Facile · Depth-first Search · Graphs

Molto facile · Graphs

Molto difficile · Graphs · Brute force

Difficile · Math · Matrix · Constructive Algorithms

Molto difficile · Graphs · Graph matchings

Molto difficile · Segment Tree · Sorting · Data Structures · Greedy algorithms

Molto difficile · Brute force · Geometry

Media · Sorting · Combinatorics · Greedy algorithms · Two pointers

Molto difficile · Disjoint set union · Trees

Media · Graphs · Implementation

Facile · Graphs

Molto difficile · Implementation

Difficile · Math · Optimization

Difficile · Number theory

Molto facile · Binary Search

Difficile · Probabilities · Bitwise Operations · Number theory