Probleme

Foarte dificil · Dynamic programming · Graphs · Shortest paths · Data Structures

Foarte ușor · Constructive Algorithms · Brute force

Dificil · Greedy algorithms · Constructive Algorithms · Number theory · Combinatorics

Dificil · Graphs · Greedy algorithms · Geometry · Math

Foarte dificil · Graphs · Depth-first Search · Constructive Algorithms

Dificil · Binary Search · Geometry · Convex Hull

Dificil · Strings · Hashing · Prefix Sums · Combinatorics

Foarte dificil · Dynamic programming · Bitmasks · Prime factorization · Combinatorics

Dificil · Binary Search · Greedy algorithms · Sorting

Foarte dificil · Graphs

Dificil · Dynamic programming · Trees · Depth-first Search · Greedy algorithms

Foarte ușor · Dynamic programming · Matrix

Ușor · Sorting

Mediu · Prefix Sums · String suffix structures

Dificil · Suffix Array · Strings

Foarte ușor · Math

Ușor · Sorting · Two pointers

Foarte ușor · Greedy algorithms

Foarte ușor · Dynamic programming

Foarte ușor · Divide and Conquer · Sorting

Ușor · Binary Search · Bitwise Operations · Sorting

Ușor · Dynamic programming · Bitwise Operations · Math

Ușor · Graphs · Greedy algorithms · Data Structures

Foarte ușor · Implementation

Ușor · Math · Implementation