Probleme

Foarte dificil · Prime factorization · Number theory · Greedy algorithms · Combinatorics

Foarte ușor · Implementation · Graphs

Mediu · Strings

Mediu · Geometry · Binary Search

Ușor · Dynamic programming · Bitmasks

Ușor · Graphs · Dynamic programming

Foarte ușor · Greedy algorithms

Dificil · Segment Tree · Range queries

Dificil · Graphs · Constructive Algorithms

Foarte dificil · Graphs · Dynamic programming

Foarte dificil · Dynamic programming

Dificil · Bitwise Operations · Greedy algorithms

Mediu · Dynamic programming

Foarte ușor · Dynamic programming

Mediu · Dynamic programming · Knapsack · Sorting

Foarte dificil · Graphs · Dynamic programming

Mediu · Binary Search · Implementation

Dificil · Graphs · Depth-first Search · Strings

Foarte dificil · Geometry · Combinatorics

Foarte dificil · Geometry

Foarte ușor · Dynamic programming · String suffix structures

Foarte dificil · Greedy algorithms · Trees · Dynamic programming · Schedules · Priority Queue

Mediu · Brute force · Greedy algorithms

Ușor · Trees

Mediu · Bitmasks · Brute force