Problemi

Difficile · Trees · Binary Search · Dynamic programming · Constructive Algorithms · Bitwise Operations

Difficile · Breadth-first Search · Constructive Algorithms

Molto difficile · Trees · Hashing · Depth-first Search · Constructive Algorithms

Facile · Prefix Sums

Facile · Number theory · Math

Facile · Math · Number theory

Difficile · Sorting · Binary Search · Greedy algorithms

Difficile · Combinatorics · Bitwise Operations · Prefix Sums · Number theory

Difficile · Greedy algorithms · Sorting · Binary Search · Strings

Media · Segment Tree · Implementation

Facile · Prefix Sums · Strings · Queries

Media · Dynamic programming

Media · Stacks · Binary Search · Two pointers

Facile · Two pointers

Molto facile · Dynamic programming

Facile · Combinatorics

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

Media · Combinatorics

Molto facile · Combinatorics · Probabilities

Media · Implementation

Difficile · Bitwise Operations · Number theory · Combinatorics · Dynamic programming

Molto difficile · Bitwise Operations · Shortest paths · Graphs · Dynamic programming

Molto difficile · Games · Greedy algorithms · Math

Media · Trees · Depth-first Search · Disjoint set union · Graphs · Sorting

Molto difficile · Bitwise Operations · Data Structures · Greedy algorithms