Problems

Very hard · Binary Search · Geometry · Scanline / Sweep Line · Sorting

Hard · Greedy algorithms · Sorting · Scanline / Sweep Line

Very hard · Scanline / Sweep Line · Segment Tree · Sorting

Very easy · Geometry · Scanline / Sweep Line

Easy · Prefix Sums · Implementation · Brute force · Scanline / Sweep Line

Easy · Geometry · Scanline / Sweep Line

Very hard · Greedy algorithms · Graph matchings · Sorting · Scanline / Sweep Line · Binary Search

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

Hard · Depth-first Search · Sorting · Scanline / Sweep Line · Data Structures · Two pointers

Very hard · Geometry · Scanline / Sweep Line · Data Structures · Sorting

Very hard · Prefix Sums · Dynamic programming · Greedy algorithms · Scanline / Sweep Line

Hard · Greedy algorithms · Sorting · Scanline / Sweep Line · Data Structures · Combinatorics · Prefix Sums

Very hard · Segment Tree · Fenwick Tree · Data Structures · Sorting · Scanline / Sweep Line · Range queries

Medium · Greedy algorithms · Scanline / Sweep Line · Sorting · Prefix Sums

Easy · Scanline / Sweep Line · Sorting · Data Structures · Geometry

Very hard · Segment Tree · Data Structures · Scanline / Sweep Line · Greedy algorithms

Hard · Geometry · Scanline / Sweep Line · Greedy algorithms

Very hard · Prefix Sums · Number theory · Sorting · Scanline / Sweep Line · Data Structures · Prime factorization