Problems

Easy · Dynamic programming · Knapsack

Very easy · Implementation

Medium · Disjoint set union · Graphs

Hard · Binary Search · Sparse Table · Greedy algorithms · Data Structures

Hard · Trees · Depth-first Search

Medium · Depth-first Search · Graphs · Sorting

Very hard · Combinatorics · Math · Number theory · Dynamic programming

Very easy · Implementation

Very hard · SQRT Decomposition · Trees · Data Structures · Queries

Hard · Trees · Depth-first Search · Greedy algorithms · Number theory

Very hard · Trees · Depth-first Search · Graphs · Binary Search · Data Structures

Very hard · Dynamic programming · Dynamic Programming Optimization · Graphs · Shortest paths · Number theory · Combinatorics · Data Structures · Convex Hull · Prime factorization

Very hard · Dynamic programming · Graphs · Depth-first Search · Sorting · Combinatorics

Hard · Meet-in-the-middle · Binary Search · Sorting · Dynamic programming

Hard · Greedy algorithms · Sorting · Combinatorics · Binary Search

Hard · Dynamic programming · Segment Tree · Binary Search · Sorting

Medium · Greedy algorithms · Sorting

Very hard · Constructive Algorithms · Combinatorics · Number theory

Very hard · Dynamic programming · Combinatorics · Math · Number theory · Strings

Easy · Greedy algorithms · Math

Very hard · Dynamic programming · Probabilities

Hard · Math · Probabilities · Games

Hard · Dynamic programming · Matrix · Divide and Conquer

Hard · Bitwise Operations · Data Structures · Greedy algorithms

Medium · Number theory · Combinatorics · Math