Problemat
E lehtë · Dynamic programming · Knapsack
Shumë e lehtë · Implementation
Mesatare · Disjoint set union · Graphs
E vështirë · Binary Search · Sparse Table · Greedy algorithms · Data Structures
E vështirë · Trees · Depth-first Search
Mesatare · Depth-first Search · Graphs · Sorting
Shumë e vështirë · Combinatorics · Math · Number theory · Dynamic programming
Shumë e lehtë · Implementation
Shumë e vështirë · SQRT Decomposition · Trees · Data Structures · Queries
E vështirë · Trees · Depth-first Search · Greedy algorithms · Number theory
Shumë e vështirë · Trees · Depth-first Search · Graphs · Binary Search · Data Structures
Shumë e vështirë · Dynamic programming · Dynamic Programming Optimization · Graphs · Shortest paths · Number theory · Combinatorics · Data Structures · Convex Hull · Prime factorization
Shumë e vështirë · Dynamic programming · Graphs · Depth-first Search · Sorting · Combinatorics
E vështirë · Meet-in-the-middle · Binary Search · Sorting · Dynamic programming
E vështirë · Greedy algorithms · Sorting · Combinatorics · Binary Search
E vështirë · Dynamic programming · Segment Tree · Binary Search · Sorting
Mesatare · Greedy algorithms · Sorting
Shumë e vështirë · Constructive Algorithms · Combinatorics · Number theory
Shumë e vështirë · Dynamic programming · Combinatorics · Math · Number theory · Strings
E lehtë · Greedy algorithms · Math
Shumë e vështirë · Dynamic programming · Probabilities
E vështirë · Math · Probabilities · Games
E vështirë · Dynamic programming · Matrix · Divide and Conquer
E vështirë · Bitwise Operations · Data Structures · Greedy algorithms
Mesatare · Number theory · Combinatorics · Math