Problems

Very hard · Dynamic programming · Graphs · Shortest paths · Data Structures

Very easy · Constructive Algorithms · Brute force

Hard · Greedy algorithms · Constructive Algorithms · Number theory · Combinatorics

Hard · Graphs · Greedy algorithms · Geometry · Math

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

Hard · Binary Search · Geometry · Convex Hull

Hard · Strings · Hashing · Prefix Sums · Combinatorics

Very hard · Dynamic programming · Bitmasks · Prime factorization · Combinatorics

Hard · Binary Search · Greedy algorithms · Sorting

Very hard · Graphs

Hard · Dynamic programming · Trees · Depth-first Search · Greedy algorithms

Very easy · Dynamic programming · Matrix

Easy · Sorting

Medium · Prefix Sums · String suffix structures

Hard · Suffix Array · Strings

Very easy · Math

Easy · Sorting · Two pointers

Very easy · Greedy algorithms

Very easy · Dynamic programming

Very easy · Divide and Conquer · Sorting

Easy · Binary Search · Bitwise Operations · Sorting

Easy · Dynamic programming · Bitwise Operations · Math

Easy · Graphs · Greedy algorithms · Data Structures

Very easy · Implementation

Easy · Math · Implementation