Probleme

Foarte ușor · Geometry

Foarte ușor · Priority Queue · Implementation

Dificil · String suffix structures · Implementation

Foarte ușor · Graphs

Foarte ușor · Binary Search · Prefix Sums · Fenwick Tree

Foarte ușor · Implementation

Foarte ușor · Implementation

Foarte ușor · Implementation · Strings

Foarte ușor · Sorting · Brute force

Mediu · Depth-first Search · Graphs

Dificil · Dynamic programming · Greedy algorithms · Combinatorics

Dificil · Dynamic programming

Dificil · Graphs · Greedy algorithms · Constructive Algorithms

Ușor · Strings · Brute force · Implementation

Mediu · Greedy algorithms · Sorting

Mediu · Constructive Algorithms · Geometry

Ușor · Graphs · Depth-first Search · Breadth-first Search

Foarte ușor · Math · Ternary search

Dificil · Depth-first Search

Dificil · Greedy algorithms · Sorting · Data Structures

Foarte ușor · Graphs · Graph network flows

Foarte dificil · Dynamic programming · Combinatorics · Number theory

Foarte dificil · Graphs · Shortest paths · Math

Dificil · Geometry · Math

Mediu · Geometry