Problems

Easy · Constructive Algorithms · Brute force

Medium · Bitwise Operations · Divide and Conquer · Combinatorics · Sorting

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

Very hard · Number theory · Prime factorization · Binary Search · Prefix Sums

Easy · Greedy algorithms · Sorting

Medium · Hashing

Hard · Bitwise Operations · Greedy algorithms · Two pointers · Prefix Sums

Very hard · Prefix Sums · Math · Queries

Very hard · Trees · Greedy algorithms · Segment Tree · Data Structures · Range queries · Sorting

Medium · Breadth-first Search · Graphs

Hard · Greedy algorithms · Priority Queue · Data Structures

Medium · Combinatorics · Dynamic programming

Hard · Trees · Graphs · Greedy algorithms

Easy · Math · Combinatorics · Hashing

Medium · Constructive Algorithms · Combinatorics

Hard · Dynamic programming · SQRT Decomposition · Prefix Sums · Greedy algorithms

Very hard · Segment Tree · Fenwick Tree · Binary Search · Data Structures · Prefix Sums

Very hard · Divide and Conquer · Sorting · Prefix Sums · Data Structures

Very easy · Implementation

Medium · Constructive Algorithms · Combinatorics · Math

Medium · Prefix Sums · Hashing

Medium · Sorting · Binary Search · Prefix Sums

Medium · Greedy algorithms · Math · Constructive Algorithms · Sorting

Easy · Number theory · Prime factorization

Hard · Combinatorics · Math · Greedy algorithms · Prefix Sums