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

Strings and Graphs

Functional graphs and cycle detection

occasional

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.

Trees and rooted traversal

Trees and rooted traversal — anchored on 2016 S3 *Phonomenal Reviews*

Counting and combinatorics

Counting and combinatorics — anchored on 2022 S3 *Good Samples* and 2017 S3 *Nailed It!*

On this page

Functional graphs and cycle detection