Problemi

Molto facile · Implementation

Facile · Depth-first Search · Breadth-first Search

Facile · Dynamic programming

Media · Geometry

Facile · Implementation

Molto facile · Graphs · Implementation

Facile · Greedy algorithms

Difficile · Combinatorics · Graphs

Facile · Divide and Conquer · Sorting

Difficile · Geometry

Difficile · Dynamic programming · Bitmasks · Number theory · Combinatorics

Media · Graphs · Shortest paths

Difficile · Sorting · Data Structures

Media · Dynamic programming · Math

Molto facile · Binary Search · Dynamic programming

Facile · Implementation · Prefix Sums

Media · Greedy algorithms · Two pointers · Prefix Sums · Math

Facile · Dynamic programming

Molto difficile · Greedy algorithms · Graph matchings · Sorting · Scanline / Sweep Line · Binary Search

Facile · Greedy algorithms

Difficile · Graphs · Geometry · Constructive Algorithms · Sorting

Facile · Sorting · Implementation · Greedy algorithms

Media · Combinatorics · Math · Brute force

Media · Dynamic programming · Combinatorics

Molto facile · Greedy algorithms