Problems

Easy · Dynamic programming · Divide and Conquer

Very hard · Dynamic programming · Number theory · Combinatorics

Very hard · Segment Tree · Range queries · Queries · Data Structures

Very hard · Breadth-first Search · Graphs · Constructive Algorithms · Number theory

Very hard · Graphs · Breadth-first Search · Combinatorics · Dynamic programming

Easy · Combinatorics · Prefix Sums · Greedy algorithms

Easy · Greedy algorithms · Prefix Sums

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

Hard · Greedy algorithms · Sorting · Two pointers

Easy · Disjoint set union · Greedy algorithms · Sorting

Medium · Prefix Sums · Sorting · Combinatorics

Very hard · Dynamic programming · Greedy algorithms · Binary Search · Sorting

Very hard · Data Structures · Greedy algorithms · Constructive Algorithms

Very hard · Graphs · Constructive Algorithms · Sorting · Stacks

Very hard · Dijkstra algorithm · Segment Tree · Graphs · Shortest paths

Easy · Dynamic programming · Greedy algorithms · Two pointers

Very hard · Combinatorics · Dynamic programming · Probabilities

Very easy · Greedy algorithms · Sorting · Binary Search

Hard · Greedy algorithms · Sorting · Constructive Algorithms

Hard · Greedy algorithms · Combinatorics

Hard · Depth-first Search · Dynamic programming · Bitmasks

Medium · Brute force · Combinatorics

Medium · Binary Search · Greedy algorithms · Sorting

Hard · Fenwick Tree · Data Structures · Prefix Sums · Greedy algorithms · Sorting

Easy · Graphs · Greedy algorithms · Disjoint set union · Sorting