Problemi

Difficile · Geometry · Convex Hull · Strings · Number theory · Sorting

Media · Dynamic programming · Strings · Greedy algorithms

Molto difficile · Dynamic programming · Matrix · Dynamic Programming Optimization

Media · Number theory · Prime factorization

Media · Math · Number theory · Hashing · Probabilities

Molto difficile · Data Structures · Trees

Difficile · Constructive Algorithms

Molto difficile · Math · Number theory

Media · Strings

Molto difficile · Combinatorics · Convex Hull · Geometry · Dynamic programming

Media · Dynamic programming · Knapsack · Combinatorics

Media · Prefix Sums · Bitwise Operations · Brute force

Molto difficile · Dynamic programming · Dynamic Programming Optimization · Sorting · Greedy algorithms

Molto difficile · Trees · Binary Search · Prefix Sums · SQRT Decomposition · Data Structures · Depth-first Search

Molto difficile · Suffix Array · Sparse Table · Data Structures · Binary Search · Strings

Molto difficile · Trees · Data Structures · Bitwise Operations · Divide and Conquer · Range queries · Prefix Sums

Difficile · Geometry · Scanline / Sweep Line · Greedy algorithms

Molto difficile · Matrix · Dynamic programming · Number theory · Bitmasks

Facile · Two pointers · Greedy algorithms

Facile · Combinatorics · Math

Media · Combinatorics · Dynamic programming

Media · Combinatorics · Number theory · Prefix Sums

Facile · Two pointers · Prefix Sums

Molto difficile · Dynamic programming · Graphs · Sorting · Shortest paths · Probabilities

Difficile · Graphs · Breadth-first Search · Strings