Competitive Programming

Algorithmic Writeups

Powered by Scribble
Reading Time27 M

The Return of Segment Trees: Lazy and Beats

The Return of Segment Trees: Lazy and Beats background
Reading Time30 M

Hardmogging with Bitmasks

Hardmogging with Bitmasks background
Reading Time29 M

Square Root Decomposition and Mo's Algorithm

Square Root Decomposition and Mo's Algorithm background
Reading Time30 M

Binary Search: The Boundary Hunter

Binary Search: The Boundary Hunter background
Reading Time51 M

Max Flow

Max Flow background
Reading Time19 M

Matrix Exponentiation

Matrix Exponentiation background
Reading Time17 M

Fenwick & Segment Trees

Fenwick & Segment Trees background
Reading Time8 M

Dynamic Programming Subset Sums

Dynamic Programming Subset Sums background
Reading Time7 M

Prefix Sums

Prefix Sums background
Reading Time8 M

Interval Math

Interval Math background
Reading Time11 M

Sniffing Out The Algo From Constraints

Sniffing Out The Algo From Constraints background