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

Trees and rooted traversal

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.

BFS/DFS on structured graphs

BFS/DFS on structured graphs — anchored on 2018 S3 *RoboThieves* and 2020 S2 *Escape Room*

Functional graphs and cycle detection

Functional graphs and cycle detection — anchored on 2014 J4/S1 *Party Invitation*

On this page

Trees and rooted traversal