Probleme

Foarte ușor · Sorting · Greedy algorithms

Foarte ușor · Brute force · String suffix structures

Foarte ușor · Graphs

Ușor · Implementation

Mediu · Greedy algorithms · Sorting · Geometry

Dificil · Dynamic programming · Combinatorics · Number theory

Ușor · Graphs · Shortest paths

Foarte ușor · Dynamic programming · Prefix Sums

Dificil · Trees · Depth-first Search · Combinatorics · Prefix Sums · Binary Search

Foarte dificil · Dynamic programming · Combinatorics · Greedy algorithms · Number theory · Stacks

Foarte ușor · Implementation

Foarte ușor · Implementation · Graphs

Mediu · Greedy algorithms · Prefix Sums

Mediu · Sorting · Greedy algorithms

Foarte ușor · Prefix Sums · Implementation

Ușor · Graphs · Disjoint set union

Foarte ușor · Binary Search · Data Structures · Dynamic programming

Foarte dificil · Binary Search · Data Structures · Greedy algorithms · Sorting

Foarte dificil · Prefix Sums · Dynamic programming · Greedy algorithms · Scanline / Sweep Line

Ușor · Prefix Sums · Dynamic programming

Foarte dificil · Trees · Dynamic programming · Combinatorics · Depth-first Search · Number theory

Foarte dificil · Dynamic programming · Dynamic Programming Optimization · Fenwick Tree · Segment Tree · Divide and Conquer

Foarte ușor · Geometry

Foarte ușor · Brute force

Foarte ușor · Sorting · Greedy algorithms