Problems

Easy · Math · Number theory

Medium · Trees · Depth-first Search

Easy · Graphs · Shortest paths

Medium · Math · Number theory

Very hard · Brute force

Hard · Dynamic programming · Probabilities

Very hard · Geometry · Graph matchings · Constructive Algorithms

Easy · Geometry

Very hard · Geometry · Math

Medium · Two pointers · Math · Sorting

Very easy · Implementation

Very hard · Dynamic programming · Dynamic Programming Optimization · Prefix Sums · Combinatorics

Hard · Number theory · Combinatorics · Bitmasks · Prime factorization

Easy · Binary Search · Segment Tree

Very easy · Math

Medium · Dynamic programming

Very hard · Graphs · Greedy algorithms · Constructive Algorithms

Very easy · Graphs

Medium · Dynamic programming · Prefix Function

Hard · Geometry · Math

Very easy · Greedy algorithms · Graphs

Easy · String suffix structures · Brute force

Very easy · Brute force · Math

Easy · Math · Combinatorics

Hard · Meet-in-the-middle · Binary Search · Greedy algorithms