Problems

Hard · Graphs · Depth-first Search · Breadth-first Search

Very easy · Implementation · Hashing

Very easy · Dynamic programming

Medium · Math

Easy · Suffix Array · String suffix structures

Easy · Sorting

Easy · Geometry

Very hard · Graphs · Dynamic programming

Very easy · Implementation

Easy · Graphs

Easy · Number theory · Math

Very hard · Graphs

Hard · Dynamic programming · Bitmasks

Hard · Dijkstra algorithm · Dynamic programming · Shortest paths

Very hard · Scanline / Sweep Line · Segment Tree · Sorting

Medium · Bitmasks · Dynamic programming · Sorting

Very hard · Greedy algorithms

Hard · Dynamic programming

Medium · Geometry

Very easy · Implementation

Very hard · Brute force

Very easy · Priority Queue · Greedy algorithms

Medium · Strings · Greedy algorithms

Medium · Implementation

Easy · Dynamic programming