Problems

Medium · Brute force · Depth-first Search · Math

Hard · Greedy algorithms · Number theory

Hard · Stacks · Dynamic programming

Hard · Combinatorics · Greedy algorithms · Hashing · Sorting

Hard · Two pointers · Prefix Sums · Greedy algorithms

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

Very hard · Segment Tree · Dynamic programming · Data Structures

Very hard · Greedy algorithms · Sorting · Constructive Algorithms

Hard · Constructive Algorithms · Math

Very hard · Dynamic programming · Strings · Combinatorics · Greedy algorithms

Very hard · Constructive Algorithms · Number theory · Greedy algorithms · Prime factorization

Very hard · Dynamic programming · Randomized algorithms · Constructive Algorithms

Very hard · SQRT Decomposition · Prefix Sums · Range queries · Data Structures · Divide and Conquer

Very hard · Trees · Segment Tree · Data Structures · Shortest paths · Queries

Hard · Trees · Fenwick Tree · Segment Tree · Prefix Sums · Data Structures · Greedy algorithms

Very hard · Segment Tree · Data Structures · Sorting · Queries

Very hard · Combinatorics · Constructive Algorithms · Binary Search · Sorting · Number theory

Medium · Greedy algorithms · Geometry · Sorting · Math

Very hard · Dynamic programming · Greedy algorithms · Constructive Algorithms · Combinatorics

Hard · Binary Search · Disjoint set union · Geometry · Graphs

Very hard · Greedy algorithms · Constructive Algorithms · Prefix Sums · Bitwise Operations

Medium · Constructive Algorithms · Sorting

Hard · Prefix Sums · Combinatorics · Math

Very hard · Bitwise Operations · Greedy algorithms · Math

Hard · Divide and Conquer · Depth-first Search · Disjoint set union · Trees · Binary Search · Graphs · Sorting