Problemi

Facile · Implementation

Media · Greedy algorithms · Sorting

Media · Breadth-first Search · Graphs

Difficile · Greedy algorithms · Prefix Sums · Sorting · Data Structures

Media · Greedy algorithms · String suffix structures

Facile · Dynamic programming · Graphs

Difficile · Dynamic programming

Molto difficile · Segment Tree · Sorting · Queries

Molto difficile · Trees · Depth-first Search · Data Structures · Divide and Conquer

Facile · Divide and Conquer · Math · Number theory

Facile · Implementation

Molto facile · Greedy algorithms · Prefix Sums

Facile · Sorting

Difficile · Sorting · Prefix Sums · Greedy algorithms

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

Media · Trees · Depth-first Search

Difficile · Disjoint set union · Sorting · Greedy algorithms · Queries

Molto facile · Graphs

Molto difficile · Dynamic programming · Combinatorics · Number theory · Prefix Sums

Facile · Dynamic programming · Greedy algorithms

Facile · Graphs · Trees

Difficile · Greedy algorithms · Sorting · Scanline / Sweep Line · Data Structures · Combinatorics · Prefix Sums

Molto facile · Trees

Molto facile · Trees · Depth-first Search

Molto facile · Interactive