Problems

Easy · Implementation

Very easy · Dynamic programming · Depth-first Search

Easy · Combinatorics · Probabilities · Math

Very easy · Brute force · String suffix structures

Very easy · String suffix structures · Bitwise Operations

Easy · Prefix Sums · Range queries

Very easy · Segment Tree · Prefix Sums

Very easy · Math

Hard · Geometry

Hard · Implementation

Very hard · Brute force

Very easy · Graphs · Dynamic programming

Very easy · Greedy algorithms · Implementation

Easy · Graphs · Shortest paths

Very hard · Graph network flows · Shortest paths · Greedy algorithms

Very hard · Probabilities · Geometry

Hard · Math · Geometry · Optimization

Easy · Geometry · Implementation · Math

Very hard · Implementation

Medium · Math · Dynamic programming

Medium · Dynamic programming · Shortest paths

Easy · Implementation

Easy · Prime factorization · Brute force · Strings

Very easy · Implementation

Easy · Geometry