Problems

Easy · Hashing

Hard · Brute force

Easy · Greedy algorithms · Sorting

Easy · Dynamic programming

Hard · Dynamic programming · Combinatorics

Very hard · Graphs

Very easy · Binary Search

Very easy · Prefix Sums · String suffix structures

Very hard · Binary Search · Greedy algorithms · Disjoint set union · Graphs · Sorting

Very hard · Probabilities

Very easy · Graphs

Very easy · Implementation

Medium

Hard · Bitmasks · Dynamic programming · Greedy algorithms

Easy · Implementation

Very easy · Brute force · Strings

Hard · Graphs · Depth-first Search · Constructive Algorithms · Strings

Hard · Shortest paths · Breadth-first Search · Graphs · Dynamic programming

Hard · Dynamic programming · Sorting · Strings · Combinatorics

Very hard · Greedy algorithms · Binary Search · Geometry · Math · Optimization

Very hard · Graph network flows · Expression parsing

Very hard · Graphs

Easy · Math

Medium · Math

Very easy · Binary Search