Problemi

Facile · Scanline / Sweep Line · Sorting · Data Structures · Geometry

Media · Dijkstra algorithm · Shortest paths · Graphs

Molto facile · Dynamic programming · Graphs · Shortest paths

Difficile · Sorting · Geometry

Difficile · Dynamic programming · Bitmasks · Binary Search

Molto difficile · Depth-first Search · Dynamic programming · Graphs · Shortest paths

Facile · Greedy algorithms · Strings

Media · Greedy algorithms · Math

Difficile · Combinatorics · Sorting · Greedy algorithms

Difficile · Graphs · Depth-first Search · Disjoint set union · Implementation

Difficile · Greedy algorithms · Stacks · Prefix Sums · Queries

Difficile · Constructive Algorithms · Greedy algorithms · Prefix Sums

Molto facile · Bitmasks · Dynamic programming · Combinatorics

Difficile · Shortest paths · Breadth-first Search · Graphs

Molto difficile · Graphs · Sorting · Two pointers · Data Structures

Difficile · Breadth-first Search · Graphs · Combinatorics · Prefix Sums · Number theory

Molto difficile · Dynamic programming · Dynamic Programming Optimization · Binary Search · Stacks

Molto difficile · Graphs · Depth-first Search · Fenwick Tree · Prefix Sums · Data Structures

Media · Implementation

Facile · Implementation

Molto facile · Math · Geometry

Difficile · Breadth-first Search · Greedy algorithms

Media · Greedy algorithms · Sorting

Molto difficile · Dynamic programming · Prefix Sums · Data Structures

Difficile · Games · Combinatorics · Prefix Sums · Number theory · Greedy algorithms