Probleme

Foarte dificil · Dynamic programming · Geometry · Combinatorics

Foarte dificil · Segment Tree · Data Structures · Scanline / Sweep Line · Greedy algorithms

Foarte dificil · Dynamic programming · Combinatorics · Graphs · Number theory

Foarte dificil · Dynamic programming · Prefix Sums · Combinatorics

Foarte ușor · Depth-first Search · Graphs

Ușor · Two pointers

Mediu · Dynamic programming · Strings

Mediu · Two pointers

Foarte ușor · Binary Search

Ușor · Implementation · Number theory

Ușor · Implementation

Foarte ușor · Dynamic programming

Ușor · Implementation · Dynamic programming

Ușor · Implementation

Foarte ușor · Greedy algorithms · Priority Queue · Sorting

Ușor · Combinatorics

Mediu · Greedy algorithms · Combinatorics · Math

Ușor · Number theory · Sorting

Mediu · Dynamic programming

Foarte ușor · Combinatorics · Probabilities

Foarte ușor · Trees · Depth-first Search

Dificil · Greedy algorithms · Sorting · Stacks

Mediu · Breadth-first Search · Shortest paths · Dynamic programming

Foarte dificil · Segment Tree · Bitwise Operations · Data Structures · Prefix Sums

Foarte ușor · Geometry · Sorting · Hashing · Binary Search · Data Structures