Problems

Easy · Sorting

Easy · Math · Brute force

Easy · Brute force · Sorting

Easy · Dynamic programming

Very hard · Dynamic programming

Easy · Greedy algorithms · String suffix structures

Very hard · Brute force · Math

Medium · Number theory · Prefix Sums · Prime factorization

Easy · Sorting · Hashing

Very hard · Dynamic programming · Divide and Conquer · Data Structures · Bitmasks

Hard · Geometry · Binary Search

Medium · Graphs · Shortest paths

Very easy · Math

Hard · Dynamic programming · Combinatorics · Trees

Very hard · Graphs · Number theory · Depth-first Search · Dynamic programming · Binary Search · Prefix Sums · Data Structures

Very hard · Segment Tree · Data Structures

Hard · Breadth-first Search · Graphs · Binary Search

Very hard · Dynamic programming · Graphs · Breadth-first Search · Dijkstra algorithm · Shortest paths

Hard · Binary Search · Hashing · Strings

Hard · Greedy algorithms · Sorting · Data Structures

Very hard · Constructive Algorithms · Graphs · Breadth-first Search · Disjoint set union

Easy · Graphs

Very easy · Implementation

Very easy · Brute force

Very easy · Brute force · Implementation