Problemi

Molto difficile · Dynamic programming · Graphs · Shortest paths · Data Structures

Molto facile · Constructive Algorithms · Brute force

Difficile · Greedy algorithms · Constructive Algorithms · Number theory · Combinatorics

Difficile · Graphs · Greedy algorithms · Geometry · Math

Molto difficile · Graphs · Depth-first Search · Constructive Algorithms

Difficile · Binary Search · Geometry · Convex Hull

Difficile · Strings · Hashing · Prefix Sums · Combinatorics

Molto difficile · Dynamic programming · Bitmasks · Prime factorization · Combinatorics

Difficile · Binary Search · Greedy algorithms · Sorting

Molto difficile · Graphs

Difficile · Dynamic programming · Trees · Depth-first Search · Greedy algorithms

Molto facile · Dynamic programming · Matrix

Facile · Sorting

Media · Prefix Sums · String suffix structures

Difficile · Suffix Array · Strings

Molto facile · Math

Facile · Sorting · Two pointers

Molto facile · Greedy algorithms

Molto facile · Dynamic programming

Molto facile · Divide and Conquer · Sorting

Facile · Binary Search · Bitwise Operations · Sorting

Facile · Dynamic programming · Bitwise Operations · Math

Facile · Graphs · Greedy algorithms · Data Structures

Molto facile · Implementation

Facile · Math · Implementation