Warm-ups (J1–J2)

The First 30 Marks Practice Problems

Data Structures, Simulation and Ad-hoc (J2–J4)

Lists and maps Simulation Intro to Geometry Ad-hoc insight problems

Strings (J3)

Strings: parsing, transforms, palindromes

Sorting and Greedy (J4)

Sorting and ordering Greedy with sorting

Counting and Casework

Counting and careful casework

Graphs and Search (J5)

Graph representation and traversal Flood fill and multi-source BFS Complete search and recursion

Prefix Sums and Intro DP (J5)

Prefix sums and difference arrays Introduction to dynamic programming Weighted grids and shortest paths

Graphs and Search (J5)

Complete search and recursion

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.

Flood fill and multi-source BFS

Flood fill and multi-source BFS — anchored on 2024 J5 *Harvest Waterloo* and 2020 J5/S2 *Escape Room*

Prefix sums and difference arrays

Prefix sums and difference arrays, anchored on 2021 J5/S2 *Modern Art* and 2026 J5/S2 *Beams of Light*

On this page

Complete search and recursion