Probleme

Foarte dificil · Disjoint set union · Dynamic programming · Graphs

Foarte dificil · Dynamic programming · Matrix · Prefix Sums · Combinatorics · Queries

Foarte dificil · Convex Hull · Binary Search · Sorting · Geometry

Foarte ușor · Implementation

Foarte ușor · Sorting · Queries

Mediu · Constructive Algorithms

Mediu · Implementation · Prefix Sums

Dificil · Binary Search · Implementation

Mediu · Segment Tree · Dynamic programming · Prefix Sums

Foarte dificil · Graphs · Prefix Sums · Trees · Data Structures

Mediu · Interactive · Binary Search

Mediu · Binary Search · Graphs

Ușor · Binary Search · Dynamic programming

Foarte ușor · Implementation

Ușor · Greedy algorithms

Mediu · Greedy algorithms · String suffix structures

Foarte ușor · Implementation · Data Structures

Ușor · Graphs · Dijkstra algorithm · Shortest paths

Foarte dificil · Graphs · Brute force

Foarte ușor · Math

Mediu · Greedy algorithms · Strings

Foarte ușor · Implementation

Ușor · Data Structures

Ușor · Implementation

Ușor · Binary Search · Math