Problemi

Facile · Trees · Depth-first Search · Prefix Sums

Molto difficile · Segment Tree · Greedy algorithms · Dynamic programming

Facile · Segment Tree · Range queries

Molto facile · Brute force

Media · Combinatorics · Number theory · Brute force

Molto facile · Greedy algorithms · Sorting · Implementation

Difficile · Meet-in-the-middle · Hashing · Strings

Media · Brute force · Number theory · Combinatorics

Difficile · Sorting · Two pointers · Greedy algorithms · Binary Search

Difficile · Breadth-first Search · Dynamic programming · Shortest paths · Sorting · Graphs

Difficile · Dynamic programming · Prefix Sums

Difficile · Greedy algorithms · Sorting · Data Structures

Media · Strings · Stacks

Molto facile · Prefix Sums · Greedy algorithms

Media · Dynamic programming

Facile · Strings · Prefix Function · Data Structures · Stacks

Media · Dynamic programming

Facile · Greedy algorithms · Priority Queue · Graphs

Facile · Dynamic programming · Fenwick Tree · Data Structures · Prefix Sums

Difficile · Strings · Hashing · Data Structures

Molto difficile · Divide and Conquer · Convex Hull · Data Structures

Molto facile · Brute force

Difficile · Greedy algorithms · Graphs · Shortest paths

Molto facile · Binary Search · Math · Two pointers

Media · Bitmasks · Brute force · Shortest paths