Logo
HomeHome
AboutAbout
CompetitiveCompetitive
BlogBlog
ResearchResearch
LifeLife
ContactContact
Logo
HomeAboutCompetitiveBlogResearchLifeContact

Competitive Programming

Algorithmic Writeups

Powered by Scribble
Reading Time1 M

Geometry VI - Advanced Rotations and Tricks

Geometry VI - Advanced Rotations and Tricks background
Reading Time1 M

Geometry V - Circles, Arcs and Tangents

Geometry V - Circles, Arcs and Tangents background
Reading Time31 M

Geometry IV - Sweep Line and Closest Pair

Geometry IV - Sweep Line and Closest Pair background
Reading Time28 M

Geometry III - Polygons and Convex Hull

Geometry III - Polygons and Convex Hull background
Reading Time33 M

Geometry II - Lines, Cuts, and Orientation

Geometry II - Lines, Cuts, and Orientation background
Reading Time1 H 8 M

Geometry I - Distance and Movement

Geometry I - Distance and Movement background
Reading Time1 H 17 M

Game Theory - Nim and Grundy Games

Game Theory - Nim and Grundy Games background
Reading Time33 M

Greedy VI - Advanced & Online

Greedy VI - Advanced & Online background
Reading Time28 M

Greedy V - Game & Competitive

Greedy V - Game & Competitive background
Reading Time28 M

Greedy IV - Threshold Feasibility

Greedy IV - Threshold Feasibility background
Reading Time35 M

Greedy III - Incremental

Greedy III - Incremental background
Reading Time28 M

Greedy II - Interval

Greedy II - Interval background
Reading Time43 M

Greedy I - Selection

Greedy I - Selection background
Reading Time27 M

Segment Trees II - Lazy and Beats

Segment Trees II - Lazy and Beats background
Reading Time30 M

Hardmogging with Bitmasks

Hardmogging with Bitmasks background
Reading Time30 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
© 2025 Leon Do ・ Competitive Programming