Math and Geometry (S1)

Coordinate geometry, rectangles, polygons Modular arithmetic and large numbers

Sorting, Greedy and Searching (S2)

Greedy with sorting and exchange arguments Two pointers and sliding window Prefix sums and difference arrays II Binary search on the answer Hash maps and frequency counting

Brute Force and Data Structures (S3)

Complete search and bounds analysis Constructive algorithms Stacks and queues Priority queues and sets Disjoint Set Union

Strings and Graphs

String processing patterns BFS/DFS on structured graphs Trees and rooted traversal Functional graphs and cycle detection Counting and combinatorics

Brute Force and Data Structures (S3)

Constructive algorithms

common

Work in progress

This module is still being written — the content here is a placeholder. This guide is open source, and contributions are welcome.

Contribute on GitHub — help write this module by opening a pull request.

Complete search and bounds analysis

Complete search and bounds analysis — anchored on 2019 S3 *Arithmetic Square* and 2013 S3 *Chances of winning*

Stacks and queues

Stacks and queues — anchored on 2015 S1 *Zero That Out* and 2014 S3 *The Geneva Confection*

On this page

Constructive algorithms