Problems

Hard · Combinatorics · Number theory · Sorting

Very easy · Greedy algorithms · Implementation

Hard · Data Structures · Binary Search

Very easy · Dynamic programming · Segment Tree

Very easy · Sorting

Very easy · Implementation

Very hard · Scanline / Sweep Line · Segment Tree · Data Structures · Prefix Sums

Hard · Dynamic programming · Number theory · Prefix Sums · Hashing

Hard · Graphs · Disjoint set union · Sorting · Greedy algorithms · Constructive Algorithms

Very easy · Combinatorics · Fast Fourier transform · Number theory · Dynamic programming

Hard · Math · Combinatorics

Very easy · Graphs

Very hard · Segment Tree · Data Structures

Very easy · Graphs · Graph network flows

Hard · Dynamic programming · Prefix Sums

Easy · Dynamic programming · Math

Very easy · Sorting

Hard · Bitmasks

Very easy · Implementation · Brute force

Very hard · Math · Brute force

Hard · Math · Implementation · Greedy algorithms

Medium · Games · Brute force

Easy · Dynamic programming

Very hard · Dynamic programming · Bitmasks

Easy · Math