Problemat

E vështirë · Geometry · Convex Hull · Strings · Number theory · Sorting

Mesatare · Dynamic programming · Strings · Greedy algorithms

Shumë e vështirë · Dynamic programming · Matrix · Dynamic Programming Optimization

Mesatare · Number theory · Prime factorization

Mesatare · Math · Number theory · Hashing · Probabilities

Shumë e vështirë · Data Structures · Trees

E vështirë · Constructive Algorithms

Shumë e vështirë · Math · Number theory

Mesatare · Strings

Shumë e vështirë · Combinatorics · Convex Hull · Geometry · Dynamic programming

Mesatare · Dynamic programming · Knapsack · Combinatorics

Mesatare · Prefix Sums · Bitwise Operations · Brute force

Shumë e vështirë · Dynamic programming · Dynamic Programming Optimization · Sorting · Greedy algorithms

Shumë e vështirë · Trees · Binary Search · Prefix Sums · SQRT Decomposition · Data Structures · Depth-first Search

Shumë e vështirë · Suffix Array · Sparse Table · Data Structures · Binary Search · Strings

Shumë e vështirë · Trees · Data Structures · Bitwise Operations · Divide and Conquer · Range queries · Prefix Sums

E vështirë · Geometry · Scanline / Sweep Line · Greedy algorithms

Shumë e vështirë · Matrix · Dynamic programming · Number theory · Bitmasks

E lehtë · Two pointers · Greedy algorithms

E lehtë · Combinatorics · Math

Mesatare · Combinatorics · Dynamic programming

Mesatare · Combinatorics · Number theory · Prefix Sums

E lehtë · Two pointers · Prefix Sums

Shumë e vështirë · Dynamic programming · Graphs · Sorting · Shortest paths · Probabilities

E vështirë · Graphs · Breadth-first Search · Strings