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

Prefix Sums and Intro DP (J5)

Weighted grids and shortest paths

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.

Introduction to dynamic programming

Introduction to dynamic programming — anchored on 2015 J5 *π-day*

On this page

Weighted grids and shortest paths