Problems

Easy · Dynamic programming

Very easy · Prefix Sums · Dynamic programming

Very easy · Sorting

Very easy · Binary Search

Medium · Sorting · Geometry · Constructive Algorithms

Very easy · Implementation

Hard · Math

Very easy · Sorting

Easy · Breadth-first Search · Shortest paths

Easy · Depth-first Search · Graphs

Very easy · Graphs

Very hard · Graphs · Brute force

Hard · Math · Matrix · Constructive Algorithms

Very hard · Graphs · Graph matchings

Very hard · Segment Tree · Sorting · Data Structures · Greedy algorithms

Very hard · Brute force · Geometry

Medium · Sorting · Combinatorics · Greedy algorithms · Two pointers

Very hard · Disjoint set union · Trees

Medium · Graphs · Implementation

Easy · Graphs

Very hard · Implementation

Hard · Math · Optimization

Hard · Number theory

Very easy · Binary Search

Hard · Probabilities · Bitwise Operations · Number theory