Probleme

Ușor · Sorting

Ușor · Math · Brute force

Ușor · Brute force · Sorting

Ușor · Dynamic programming

Foarte dificil · Dynamic programming

Ușor · Greedy algorithms · String suffix structures

Foarte dificil · Brute force · Math

Mediu · Number theory · Prefix Sums · Prime factorization

Ușor · Sorting · Hashing

Foarte dificil · Dynamic programming · Divide and Conquer · Data Structures · Bitmasks

Dificil · Geometry · Binary Search

Mediu · Graphs · Shortest paths

Foarte ușor · Math

Dificil · Dynamic programming · Combinatorics · Trees

Foarte dificil · Graphs · Number theory · Depth-first Search · Dynamic programming · Binary Search · Prefix Sums · Data Structures

Foarte dificil · Segment Tree · Data Structures

Dificil · Breadth-first Search · Graphs · Binary Search

Foarte dificil · Dynamic programming · Graphs · Breadth-first Search · Dijkstra algorithm · Shortest paths

Dificil · Binary Search · Hashing · Strings

Dificil · Greedy algorithms · Sorting · Data Structures

Foarte dificil · Constructive Algorithms · Graphs · Breadth-first Search · Disjoint set union

Ușor · Graphs

Foarte ușor · Implementation

Foarte ușor · Brute force

Foarte ușor · Brute force · Implementation