Problems

Very hard · Binary Search · Dynamic programming · Trees

Medium · Constructive Algorithms · Greedy algorithms

Very easy · Matrix · Segment Tree

Very easy · Dynamic programming · Hashing

Very easy · Dynamic programming

Very easy · Number theory · Prime factorization

Medium · Geometry

Very hard · Binary Search · Graph network flows · Greedy algorithms

Very easy · Greedy algorithms

Easy · Number theory · Math

Hard · Breadth-first Search · Graphs

Easy · Divide and Conquer

Very hard · String suffix structures · Suffix Array · Strings

Hard · Graphs · Geometry · Depth-first Search · Constructive Algorithms · Sorting

Very hard · Number theory

Very hard · Dynamic programming · Combinatorics

Very hard · Dynamic programming

Medium · Combinatorics · Constructive Algorithms · Graphs

Very hard · Graphs · Dynamic programming

Hard · Geometry

Hard · Dynamic programming · Sorting

Medium · Bitwise Operations · Strings

Medium · Geometry · Math

Very hard · Math

Very easy · Implementation