Problems

Medium · Brute force · Bitmasks

Hard · Combinatorics · Dynamic programming · Number theory

Very hard · Hashing · Binary Search · Sorting · Number theory

Easy · Graphs · Trees

Very hard · Geometry

Very hard · Breadth-first Search · Hashing · Bitmasks

Easy · String suffix structures · Implementation

Easy · Sorting · Greedy algorithms

Easy · Priority Queue

Hard · Graphs · Shortest paths

Very easy · Geometry

Easy · Graphs

Medium · Dynamic programming

Very hard · Graphs · Greedy algorithms · Depth-first Search · Prefix Sums

Very hard · Dynamic programming

Very easy · Dynamic programming

Medium · Implementation · Dynamic programming

Very easy · Implementation

Very easy · Graphs · Brute force

Hard · Geometry

Very easy · Geometry

Hard · Geometry · Disjoint set union · Graphs

Very easy · Implementation

Medium · Depth-first Search

Very easy · Implementation