Problems

Easy · Geometry · Binary Search · Ternary search · Convex Hull · Optimization

Medium · Number theory · Math

Very hard · Sorting · Constructive Algorithms · Greedy algorithms · Interactive

Very hard · Greedy algorithms · Probabilities · Binary Search · Prefix Sums · Sorting

Easy · Breadth-first Search · Shortest paths · Graphs · Greedy algorithms

Medium · Greedy algorithms · Brute force

Hard · Greedy algorithms · Constructive Algorithms

Very hard · Constructive Algorithms · Graphs · Trees · Greedy algorithms

Medium · Graphs

Very easy · Greedy algorithms · Hashing · Two pointers

Medium · Strings · Two pointers · Greedy algorithms

Very easy · Graphs · Depth-first Search · Constructive Algorithms

Medium · Dynamic programming · Dynamic Programming Optimization · Greedy algorithms

Very easy · Implementation

Very easy · Implementation

Very easy · Depth-first Search · Trees

Very easy · Math

Very easy · Two pointers · Prefix Sums

Easy · Sorting · Brute force

Very easy · Breadth-first Search · Graphs

Medium · Greedy algorithms · Sorting

Very easy · Prefix Sums

Easy · Greedy algorithms · Data Structures · Sorting

Medium · Dynamic programming

Hard · Breadth-first Search · Shortest paths