Problems

Medium · Dynamic programming · Strings

Very easy · Dynamic programming

Very easy · String suffix structures · Graphs

Very easy · Graphs · Strings

Very easy · Graphs · Shortest paths · Math

Medium · Greedy algorithms · Geometry

Very easy · Implementation

Hard · Geometry · Combinatorics · Sorting

Hard · Dynamic programming · Graphs · Depth-first Search · Greedy algorithms

Very hard · Graphs

Easy · Dynamic programming · String suffix structures

Easy · Disjoint set union · Graphs

Very easy · Dynamic programming · Math

Very easy · Bitmasks · Binary Search

Very easy · Segment Tree · Implementation

Very easy · Dynamic programming

Very hard · Prefix Sums · Data Structures

Very easy · Implementation · Data Structures

Medium · Data Structures · Binary Search

Very easy · Dynamic programming

Medium · Dynamic programming · Math

Easy · Dynamic programming · Binary Search · Graphs

Medium · Dynamic programming · String suffix structures

Hard · Greedy algorithms · Sorting

Very easy · Implementation