Problems

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

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

Very hard · 2-SAT · Binary Search · Segment Tree · Data Structures · Prefix Sums · Graphs

Very hard · Meet-in-the-middle · Graphs · Trees · Depth-first Search · Bitmasks · Greedy algorithms · Constructive Algorithms

Easy · Implementation

Medium · Math · Constructive Algorithms

Very easy · Implementation

Hard · Math · Combinatorics

Medium · Brute force · Number theory

Medium · Dynamic programming · Combinatorics

Medium · Math · Greedy algorithms

Very hard · Dynamic programming · Prefix Sums · Stacks · Combinatorics

Easy · Hashing · Implementation

Medium · Greedy algorithms · Sorting · Number theory

Hard · Prefix Sums · Binary Search · Fenwick Tree · Sorting

Hard · Bitmasks · Bitwise Operations · Dynamic programming · Breadth-first Search

Very hard · Dynamic programming · Combinatorics · Number theory · Prefix Sums

Very easy · 2-SAT

Very hard · Two pointers · Prefix Sums · Greedy algorithms

Very hard · Dynamic programming · Sorting · Segment Tree · Data Structures

Very hard · Segment Tree · Data Structures · Greedy algorithms · Combinatorics

Very hard · Greedy algorithms · Sorting · Constructive Algorithms

Hard · Constructive Algorithms · Math

Very hard · Dynamic programming · Greedy algorithms · Strings · Constructive Algorithms

Very hard · Bitwise Operations