Competitive Programming

Algorithmic Writeups

Powered by Scribble

Reading Time33 M

Graph Connectivity & Decomposition (CC, SCC, 2-SAT)

Reading Time1 M

Geometry VI - Advanced Rotations and Tricks

Reading Time1 M

Geometry V - Circles, Arcs and Tangents

Reading Time31 M

Geometry IV - Sweep Line and Closest Pair

Reading Time28 M

Geometry III - Polygons and Convex Hull

Reading Time33 M

Geometry II - Lines, Cuts, and Orientation

Reading Time1 H 8 M

Geometry I - Distance and Movement

Reading Time1 H 17 M

Game Theory - Nim and Grundy Games

Reading Time33 M

Greedy VI - Advanced & Online

Reading Time28 M

Greedy V - Game & Competitive

Reading Time28 M

Greedy IV - Threshold Feasibility

Reading Time35 M

Greedy III - Incremental

Reading Time28 M

Greedy II - Interval

Reading Time43 M

Greedy I - Selection

Reading Time27 M

Segment Trees II - Lazy and Beats

Reading Time30 M

Hardmogging with Bitmasks

Reading Time30 M

Square Root Decomposition and Mo's Algorithm

Reading Time30 M

Binary Search: The Boundary Hunter

Reading Time51 M

Max Flow

Reading Time19 M

Matrix Exponentiation

Reading Time17 M

Fenwick & Segment Trees

Reading Time8 M

Dynamic Programming Subset Sums

Reading Time7 M

Prefix Sums

Reading Time8 M

Interval Math

Reading Time11 M

Sniffing Out The Algo From Constraints