Problems

Hard · Geometry · Convex Hull · Strings · Number theory · Sorting

Medium · Dynamic programming · Strings · Greedy algorithms

Very hard · Dynamic programming · Matrix · Dynamic Programming Optimization

Medium · Number theory · Prime factorization

Medium · Math · Number theory · Hashing · Probabilities

Very hard · Data Structures · Trees

Hard · Constructive Algorithms

Very hard · Math · Number theory

Medium · Strings

Very hard · Combinatorics · Convex Hull · Geometry · Dynamic programming

Medium · Dynamic programming · Knapsack · Combinatorics

Medium · Prefix Sums · Bitwise Operations · Brute force

Very hard · Dynamic programming · Dynamic Programming Optimization · Sorting · Greedy algorithms

Very hard · Trees · Binary Search · Prefix Sums · SQRT Decomposition · Data Structures · Depth-first Search

Very hard · Suffix Array · Sparse Table · Data Structures · Binary Search · Strings

Very hard · Trees · Data Structures · Bitwise Operations · Divide and Conquer · Range queries · Prefix Sums

Hard · Geometry · Scanline / Sweep Line · Greedy algorithms

Very hard · Matrix · Dynamic programming · Number theory · Bitmasks

Easy · Two pointers · Greedy algorithms

Easy · Combinatorics · Math

Medium · Combinatorics · Dynamic programming

Medium · Combinatorics · Number theory · Prefix Sums

Easy · Two pointers · Prefix Sums

Very hard · Dynamic programming · Graphs · Sorting · Shortest paths · Probabilities

Hard · Graphs · Breadth-first Search · Strings