Problems

Hard · Combinatorics · Disjoint set union · Trees · Number theory

Easy · Combinatorics · Number theory

Easy · Combinatorics · Number theory · Prefix Sums

Very easy · Combinatorics · Math

Very easy · Combinatorics · Number theory

Easy · Trees · Depth-first Search · Graphs · Data Structures · Prefix Sums · Sorting

Medium · Segment Tree · Data Structures · Greedy algorithms · Combinatorics

Hard · Dynamic programming · Knapsack · Sorting

Hard · Constructive Algorithms · Strings · Greedy algorithms

Hard · Greedy algorithms · Prefix Sums · Sorting · Constructive Algorithms

Hard · Games · Trees · Depth-first Search

Hard · Greedy algorithms · Constructive Algorithms

Very hard · Greedy algorithms · Sorting · Data Structures · Constructive Algorithms · Trees

Easy · Greedy algorithms · Sorting

Hard · Greedy algorithms · Graphs · Sorting · Combinatorics

Easy · Breadth-first Search · Graphs · Shortest paths

Very easy · Prefix Sums · Bitwise Operations

Easy · Binary Search

Easy · Binary Search

Easy · Dynamic programming

Very easy · Combinatorics · Number theory

Very easy · Implementation

Hard · Dynamic programming · Knapsack

Medium · Number theory · Prefix Sums · Hashing

Easy · Trees · Depth-first Search · Data Structures · Greedy algorithms