Problems

Easy · Implementation

Medium · Strings

Medium · Geometry

Very hard · Graph network flows · Shortest paths · Graphs

Hard · Graphs · Depth-first Search · Sorting

Very hard · Geometry

Hard · Dynamic programming · Graphs

Hard · Combinatorics · Number theory · Math

Hard · Greedy algorithms

Medium · Shortest paths · Graphs

Easy · Dynamic programming · Implementation

Very easy · Probabilities · String suffix structures

Easy · Greedy algorithms

Very hard · Graphs · Graph matchings

Very hard · Strings · Prefix Function · Dynamic programming · Graphs · Probabilities · Breadth-first Search · Matrix

Very hard · Graphs

Very hard · Dynamic programming · Bitmasks

Very hard · Bitmasks · Dynamic programming

Very hard · Geometry · Constructive Algorithms

Very hard · String suffix structures · Implementation

Easy · Brute force

Very easy · Graphs · Graph network flows

Very hard · Strings · Z-function · Suffix Array

Very hard · Geometry

Very easy · Dynamic programming