Probleme

Ușor · Implementation

Mediu · Strings

Mediu · Geometry

Foarte dificil · Graph network flows · Shortest paths · Graphs

Dificil · Graphs · Depth-first Search · Sorting

Foarte dificil · Geometry

Dificil · Dynamic programming · Graphs

Dificil · Combinatorics · Number theory · Math

Dificil · Greedy algorithms

Mediu · Shortest paths · Graphs

Ușor · Dynamic programming · Implementation

Foarte ușor · Probabilities · String suffix structures

Ușor · Greedy algorithms

Foarte dificil · Graphs · Graph matchings

Foarte dificil · Strings · Prefix Function · Dynamic programming · Graphs · Probabilities · Breadth-first Search · Matrix

Foarte dificil · Graphs

Foarte dificil · Dynamic programming · Bitmasks

Foarte dificil · Bitmasks · Dynamic programming

Foarte dificil · Geometry · Constructive Algorithms

Foarte dificil · String suffix structures · Implementation

Ușor · Brute force

Foarte ușor · Graphs · Graph network flows

Foarte dificil · Strings · Z-function · Suffix Array

Foarte dificil · Geometry

Foarte ușor · Dynamic programming