Problems

Very hard · Disjoint set union · Dynamic programming · Graphs

Very hard · Dynamic programming · Matrix · Prefix Sums · Combinatorics · Queries

Very hard · Convex Hull · Binary Search · Sorting · Geometry

Very easy · Implementation

Very easy · Sorting · Queries

Medium · Constructive Algorithms

Medium · Implementation · Prefix Sums

Hard · Binary Search · Implementation

Medium · Segment Tree · Dynamic programming · Prefix Sums

Very hard · Graphs · Prefix Sums · Trees · Data Structures

Medium · Interactive · Binary Search

Medium · Binary Search · Graphs

Easy · Binary Search · Dynamic programming

Very easy · Implementation

Easy · Greedy algorithms

Medium · Greedy algorithms · String suffix structures

Very easy · Implementation · Data Structures

Easy · Graphs · Dijkstra algorithm · Shortest paths

Very hard · Graphs · Brute force

Very easy · Math

Medium · Greedy algorithms · Strings

Very easy · Implementation

Easy · Data Structures

Easy · Implementation

Easy · Binary Search · Math