Probleme

Foarte ușor · Implementation

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

Ușor · Dynamic programming

Mediu · Geometry

Ușor · Implementation

Foarte ușor · Graphs · Implementation

Ușor · Greedy algorithms

Dificil · Combinatorics · Graphs

Ușor · Divide and Conquer · Sorting

Dificil · Geometry

Dificil · Dynamic programming · Bitmasks · Number theory · Combinatorics

Mediu · Graphs · Shortest paths

Dificil · Sorting · Data Structures

Mediu · Dynamic programming · Math

Foarte ușor · Binary Search · Dynamic programming

Ușor · Implementation · Prefix Sums

Mediu · Greedy algorithms · Two pointers · Prefix Sums · Math

Ușor · Dynamic programming

Foarte dificil · Greedy algorithms · Graph matchings · Sorting · Scanline / Sweep Line · Binary Search

Ușor · Greedy algorithms

Dificil · Graphs · Geometry · Constructive Algorithms · Sorting

Ușor · Sorting · Implementation · Greedy algorithms

Mediu · Combinatorics · Math · Brute force

Mediu · Dynamic programming · Combinatorics

Foarte ușor · Greedy algorithms